A semi-discrete approximation for first-order stationary mean field games
Renato Iturriaga, Kaizhi Wang

TL;DR
This paper introduces a semi-discrete approximation scheme for first-order stationary mean field games with separable Hamiltonians, demonstrating convergence of discrete solutions to the continuous problem.
Contribution
It develops a novel discretization method for Hamilton-Jacobi equations in mean field games and proves the convergence of discrete solutions to the continuous solution.
Findings
Established existence of minimizing holonomic measures.
Proved convergence of discrete solutions to the continuous mean field game solution.
Provided a new approximation scheme for stationary mean field games.
Abstract
We provide an approximation scheme for first-order stationary mean field games with a separable Hamiltonian. First, we discretize Hamilton-Jacobi equations by discretizing in time, and then prove the existence of minimizing holonomic measures for mean field games. At last, we obtain two sequences of solutions of discrete Hamilton-Jacobi equations and minimizing holonomic measures for mean field games and show that converges to a solution of the stationary mean field games.
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 · Quantum chaos and dynamical systems · Markov Chains and Monte Carlo Methods
