A Policy Iteration Method for Inverse Mean Field Games
Not on the map. Why?
Abstract (arXiv)
We propose a policy iteration method to solve an inverse problem for a mean-field game (MFG) model, specifically to reconstruct the obstacle function in the game from the partial observation data of value functions, which represent the optimal costs for agents. The proposed approach decouples this complex inverse problem, which is an optimization problem constrained by a coupled nonlinear forward and backward PDE system in the MFG, into several iterations of solving linear PDEs and linear inverse problems. This method can also be viewed as a fixed-point iteration that simultaneously solves the MFG system and inversion. We prove its linear rate of convergence. In addition, numerical examples in 1D and 2D, along with performance comparisons to a direct least-squares method, demonstrate the superior efficiency and accuracy of the proposed method for solving inverse MFGs.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Sep 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 3.
3 papers.
- 2025Learning Surrogate Potential Mean Field Games via Gaussian Processes: A Data-Driven Approach to Ill-Posed Inverse Problemscited by 2
- 2025A Robust Model-Based Approach for Continuous-Time Policy Evaluation with Unknown L'evy Process Dynamicscited by 0
- 2025Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problemscited by 0
- 2025Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problems1 May 2025
- 2025A Robust Model-Based Approach for Continuous-Time Policy Evaluation with Unknown L'evy Process Dynamics2 Apr 2025
- 2025Learning Surrogate Potential Mean Field Games via Gaussian Processes: A Data-Driven Approach to Ill-Posed Inverse Problems17 Feb 2025