Monotone numerical methods for finite-state mean-field games
Diogo Gomes, Joao Saude

TL;DR
This paper introduces monotone numerical methods for finite-state mean-field games, leveraging a contraction flow approach to effectively solve the complex boundary value problems inherent in MFGs.
Contribution
The paper develops a novel numerical approach based on monotonicity that guarantees convergence to solutions of finite-state MFGs with challenging boundary conditions.
Findings
The methods successfully solve stationary and time-dependent MFGs.
Numerical experiments demonstrate convergence and accuracy.
Application to a paradigm-shift problem illustrates practical utility.
Abstract
Here, we develop numerical methods for finite-state mean-field games (MFGs) that satisfy a monotonicity condition. MFGs are determined by a system of differential equations with initial and terminal boundary conditions. These non-standard conditions are the main difficulty in the numerical approximation of solutions. Using the monotonicity condition, we build a flow that is a contraction and whose fixed points solve the MFG, both for stationary and time-dependent problems. We illustrate our methods in a MFG modeling the paradigm-shift problem.
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 · Numerical methods for differential equations · Probabilistic and Robust Engineering Design
