Hostname: page-component-77f85d65b8-7lfxl Total loading time: 0 Render date: 2026-03-30T07:11:52.418Z 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: irle@math.uni-kiel.de
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(Z n ), where Z n , 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 B 0B 1B 2 ⊇ · · · 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.

Information

Type
Research Papers
Copyright
© Applied Probability Trust 2006