On an Effective Solution of the Optimal Stopping Problem for Random Walks

DOI10.1137/S0040585X97981093zbMath1092.60018OpenAlexW3021211238MaRDI QIDQ5700638

Albert N. Shiryaev, Alexander Novikov

Publication date: 28 October 2005

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0040585x97981093

zbMATH Keywords

rate of convergenceAppell polynomials

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (15)

Optimal stopping time for geometric random walks with power payoff function ⋮ A bias-corrected least-squares Monte Carlo for solving multi-period utility models ⋮ Optimal stopping time problem for random walks with polynomial reward functions ⋮ On optimal threshold stopping times for Ito diffusions ⋮ A general method for finding the optimal threshold in discrete time ⋮ Optimality of Threshold Stopping Times for Diffusion Processes ⋮ Probabilistic approach to Appell polynomials ⋮ Discrete approximation of finite-horizon American-style options ⋮ Optimal stopping of oscillating Brownian motion ⋮ One-sided solutions for optimal stopping problems with logconcave reward functions ⋮ Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen ⋮ Optimal Stopping for Lévy Processes with One-Sided Solutions ⋮ Impulse control and expected suprema ⋮ Optimal Stopping for Processes with Independent Increments, and Applications ⋮ An approach for solving perpetual optimal stopping problems driven by Lévy processes

This page was built for publication: On an Effective Solution of the Optimal Stopping Problem for Random Walks