TOPICS
Search

Optimal Stopping


Optimal stopping is the problem of choosing a stopping time to maximize the expected value of a stochastic reward. For a reward process (Y_t) adapted to a filtration (F_t), the finite-horizon value process is

 V_t=esssup_(tau in T_(t,T))E[Y_tau|F_t],

where T_(t,T) is the set of admissible stopping times taking values in [t,T]. The operator esssup denotes the essential supremum, which is the least almost-sure upper bound for the conditional expectations, ignoring changes on events of probability zero. Under standard integrability conditions, V is the Snell envelope of Y, and an optimal rule is often the first time at which V_t=Y_t.

Valuing an American option is an optimal stopping problem whose reward is the discounted exercise payoff. When the reward depends on a Markov process, the same problem can be described by a variational inequality or a free boundary problem.


See also

American Option, Conditional Expectation, Essential Supremum, Filtration, Free Boundary Problem, Snell Envelope, Stopping Time, Variational Inequality

Explore with Wolfram|Alpha

References

Peskir, G. and Shiryaev, A. Optimal Stopping and Free-Boundary Problems. Basel, Switzerland: Birkhäuser, 2006. https://doi.org/10.1007/978-3-7643-7390-0.Snell, J. L. "Applications of Martingale System Theorems." Trans. Amer. Math. Soc. 73, 293-312, 1952. https://doi.org/10.2307/1990670.

Cite this as:

Weisstein, Eric W. "Optimal Stopping." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OptimalStopping.html

Subject classifications