mlsanityData to 7 Oct 2026

Dynamic programming for optimal control of stochastic McKean-Vlasov dynamics

arXiv 1604.04057 ↗First posted 14 Apr 2016math.PR math.OCcited by 11

Not on the map. Why?

Abstract (arXiv)

We study the optimal control of general stochastic McKean-Vlasov equation. Such problem is motivated originally from the asymptotic formulation of cooperative equilibrium for a large population of particles (players) in mean-field interaction under common noise. Our first main result is to state a dynamic programming principle for the value function in the Wasserstein space of probability measures, which is proved from a flow property of the conditional law of the controlled state process. Next, by relying on the notion of differentiability with respect to probability measures due to P.L. Lions [32], and Ito's formula along a flow of conditional measures, we derive the dynamic programming Hamilton-Jacobi-Bellman equation, and prove the viscosity property together with a uniqueness result for the value function. Finally, we solve explicitly the linear-quadratic stochastic McKean-Vlasov control problem and give an application to an interbank systemic risk model with common noise.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Apr 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 3; 2025: 0; 2026: 6.

11 papers.