Discrete time McKean-Vlasov control problem: a dynamic programming approach
Huy\^en Pham (LPMA), Xiaoli Wei (LPMA)

TL;DR
This paper develops a dynamic programming approach for discrete-time McKean-Vlasov control problems, reformulating them into deterministic problems with distribution as the state, and applies it to portfolio optimization and linear-quadratic control.
Contribution
It introduces a novel dynamic programming framework for nonlinear mean-field systems in discrete time, enabling explicit solutions for complex control problems.
Findings
Explicit solutions for mean-variance portfolio selection.
Solution to multivariate linear-quadratic McKean-Vlasov control.
Validation of the dynamic programming principle in this context.
Abstract
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean-Vlasov control problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Insurance, Mortality, Demography, Risk Management · Risk and Portfolio Optimization
