Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-23T21:36:11.250Z Has data issue: false hasContentIssue false

A Forward Algorithm for Solving Optimal Stopping Problems

Published online by Cambridge University Press:  14 July 2016

Albrecht Irle*
Affiliation:
University of Kiel
*
Postal address: Mathematisches Seminar, University of Kiel, Ludwig-Meyn-Strasse 4, D-24098 Kiel, Germany. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the optimal stopping problem for g(Zn), where Zn, n = 1, 2, …, is a homogeneous Markov sequence. An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B0B1B2 ⊇ · · · of subsets of the state space such that the first entrance time into the intersection F of these sets is an optimal stopping time. Various applications are given.

Type
Research Papers
Copyright
© Applied Probability Trust 2006 

References

Beibel, M. and Lerche, H. R. (1997). A new look at optimal stopping problems related to mathematical finance. Statistica Sinica 7, 93108.Google Scholar
Chow, Y. S., Robbins, H. and Siegmund, D. (1971). Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston, MA.Google Scholar
Feller, W. (1957). An Introduction to Probability and Statistics, Vol. I, 2nd edn. John Wiley, New York.Google Scholar
Irle, A. (1980). On the best choice problem with random population size. Z. Operat. Res. 24, 177190.Google Scholar
Shiryayev, A. N. (1978). Optimal Stopping Rules. Springer, New York.Google Scholar