Abstract

In this chapter we present the dynamic programming approach to optimal stopping problems. We start by presenting the discrete time theory, deriving the relevant Bellman equation. We present the Snell envelope and prove the Snell Envelope Theorem. For Markovian models we explore the connection to alpha-excessive functions. The continuous time theory is presented by deriving the free boundary value problem connected to the stopping problem, and we also derive the associated system of variational inequalities. American options are discussed in some detail.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.