Abstract
The optimal stopping problem can be considered for nearly any stochastic process, and its formulation will be similar in each case. But its solution will be relatively simple only for a few processes. One class of such processes consists of discrete-time Markov chains.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gusak, D., Kukush, A., Kulik, A., Mishura, Y., Pilipenko, A. (2010). Optimal stopping of random sequences and processes. In: Theory of Stochastic Processes. Problem Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-87862-1_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-87862-1_15
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-87861-4
Online ISBN: 978-0-387-87862-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)