CitedEvidence
User Settings
Open AccessArticle10.1515/dema-2013-0385

On general optimal stopping problems using penalty method

Łukasz Stettner-2012-06-01-Demonstratio Mathematica

TL;DRAbstract

Abstract In the paper we use penalty method to approximate a number of general stopping problems over finite horizon. We consider optimal stopping of discrete time or right continuous stochastic processes, and show that suitable version of Snell’s envelope can by approximated by solutions to penalty equations. Then we study optimal stopping problem for Markov processes on a general Polish space, and again show that the optimal stopping value function can be approximated by a solution to a Markov version of the penalty equation.

Chat with Paper

AI Agents for this Paper

Abstract In the paper we use penalty method to approximate a number of general stopping problems over finite horizon. We consider optimal stopping of discrete time or right continuous stochastic processes, and show that suitable version of Snell’s envelope can by approximated by solutions to penalty equations. Then we study optimal stopping problem for Markov processes on a general Polish space, and again show that the optimal stopping value function can be approximated by a solution to a Markov version of the penalty equation.

Keywords

Optimal stoppingPenalty methodMathematicsStopping timeBellman equationMathematical optimizationMarkov processApplied mathematics

Chat

Click to start Chat