Dynamic Programming Principles for Optimal Stopping with Expectation Constraint

arXiv1708.02192MaRDI QIDQ6289873FDOQ6289873

Publication date: 7 August 2017

Abstract: We analyze an optimal stopping problem with a constraint on the expected cost. When the reward function and cost function are Lipschitz continuous in state variable, we show that the value of such an optimal stopping problem is a continuous function in current state and in budget level. Then we derive a dynamic programming principle (DPP) for the value function in which the conditional expected cost acts as an additional state process. As the optimal stopping problem with expectation constraint can be transformed to a stochastic optimization problem with supermartingale controls, we explore a second DPP of the value function and thus resolve an open question recently raised in [S. Ankirchner, M. Klein, and T. Kruse, A verification theorem for optimal stopping problems with expectation constraints, Appl. Math. Optim., 2017, pp. 1-33]. Based on these two DPPs, we characterize the value function as a viscosity solution to the related fully non-linear parabolic Hamilton-Jacobi-Bellman equation.

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Viscosity solutions to Hamilton-Jacobi equations in optimal control and differential games (49L25) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stochastic control (93E20)

This page was built for publication: Dynamic Programming Principles for Optimal Stopping with Expectation Constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6289873)