arXiv · 2611.21837
Primal--Dual Kullback--Leibler Mirror-Prox for Dynamic Mean Field Games
Abstract
We compute finite-horizon dynamic mean field equilibria using a primal--dual Kullback--Leibler Mirror-Prox algorithm. Each iteration updates occupation measures by exponential tilting and computes the dual correction by solving a linear PDE, without solving a nonlinear Hamilton--Jacobi--Bellman equation or a best-response control problem. Under assumptions and Lasry--Lions monotonicity, we prove an $O(K^{-1})$ ergodic Minty bound after $K$ iterations and an $O(K^{-1/2})$ approximate-equilibrium bound for the corrected average. We obtain convergence rates for the population flow under strong monotonicity, and for smooth diffusions with uniformly convex control costs under ordinary monotonicity. We also prove convergence of continuous-time Markov chain approximations to diffusion equilibria and, under additional smoothness and convexity assumptions, bound the error in terms of the spatial mesh size and the number of iterations. Galerkin approximations preserve the $O(K^{-1})$ estimates under suitable bounds on the correction errors. Numerical experiments illustrate the method and its convergence.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Erhan Bayraktar, Ibrahim Ekren, Lu Vy, Ziqing Zhang. 2026-11-16. Primal--Dual Kullback--Leibler Mirror-Prox for Dynamic Mean Field Games. https://searcharxiv.com/abs/2611.21837
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.