Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework
arXiv:1310.3363
Abstract
We give a brief presentation of the capacity theory and show how it derives naturally a measurable selection theorem following the approach of Dellacherie (1972). Then we present the classical method to prove the dynamic programming of discrete time stochastic control problem, using measurable selection arguments. At last, we propose a continuous time extension, that is an abstract framework for the continuous time dynamic programming principle (DPP).
28 pages
References in corpus (3)
Cited by in corpus (16)
- Capacities, Measurable Selection and Dynamic Programming Part II: Application in Stochastic Control Problems
- Weak approximation of second-order BSDEs
- Zero-sum path-dependent stochastic differential games in weak formulation
- Measurability of Semimartingale Characteristics with Respect to the Probability Law
- Optimal Skorokhod embedding under finitely-many marginal constraints
- A Dynamic Programming Principle for Distribution-Constrained Optimal Stopping
- Reduced-form setting under model uncertainty with non-linear affine processes
- A -functional Itô's formula and its applications in mathematical finance
- Stochastic Control with Delayed Information and Related Nonlinear Master Equation
- Controlled superprocesses and HJB equation in the space of finite measures
- Contract theory in a VUCA world
- On the monotonicity principle of optimal Skorokhod embedding problem
- Finite Horizon Robust Impulse Control in a Non-Markovian Framework and Related Systems of Reflected BSDEs
- Reflections on BSDEs
- Deep Learning for Constrained Utility Maximisation
- On Dynamic Programming Principle for Stochastic Control under Expectation Constraints