Policy iteration method for time-dependent Mean Field Games systems with non-separable Hamiltonians
Not on the map. Why?
Abstract (arXiv)
We introduce two algorithms based on a policy iteration method to numerically solve time-dependent Mean Field Game systems of partial differential equations with non-separable Hamiltonians. We prove the convergence of such algorithms in sufficiently small time intervals with Banach fixed point method. Moreover, we prove that the convergence rates are linear. We illustrate our theoretical results by numerical examples, and we discuss the performance of the proposed algorithms.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Oct 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 2.
4 papers.
- 2023Deep Learning for Mean Field Games with non-separable Hamiltonianscited by 1
- 2025Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problemscited by 0
- 2026Recurrent Structural Policy Gradient for Partially Observable Mean Field Gamescited by 0
- 2026Towards Model-Free Learning in Dynamic Population Games: An Application to Karma Economiescited by 0
- 2026Towards Model-Free Learning in Dynamic Population Games: An Application to Karma Economies11 May 2026
- 2026Recurrent Structural Policy Gradient for Partially Observable Mean Field Games23 Feb 2026
- 2025Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problems1 May 2025
- 2023Deep Learning for Mean Field Games with non-separable Hamiltonians7 Jan 2023