A Dynamic Programming Principle for Distribution-Constrained Optimal Stopping
classification
🧮 math.OC
q-fin.MF
keywords
problemstoppingconstraintdynamicoptimalprincipleprogrammingallows
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.