A Dynamic Programming Principle for Distribution-Constrained Optimal Stopping
arXiv:1703.08534
Abstract
We consider an optimal stopping problem where a constraint is placed on the distribution of the stopping time. Reformulating the problem in terms of so-called measure-valued martingales allows us to transform the marginal constraint into an initial condition and view the problem as a stochastic control problem; we establish the corresponding dynamic programming principle.
References in corpus (5)
- Constructing Sublinear Expectations on Path Space
- Capacities, Measurable Selection and Dynamic Programming Part II: Application in Stochastic Control Problems
- Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework
- Optimal Transport and Skorokhod Embedding
- Geometry of Distribution-Constrained Optimal Stopping Problems