Proximal methods for stationary Mean Field Games with local couplings
arXiv:1608.07701 · doi:10.1137/16M1095615
Abstract
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion effects. For finite difference discretizations of the Mean Field Game system, we follow a variational approach. We prove that the aforementioned schemes can be obtained as the optimality system of suitably defined optimization problems. In order to prove the existence of solutions of the scheme with a variational argument, the monotonicity of the coupling term is not used, which allow us to recover general existence results. Next, assuming next that the coupling term is monotone, the variational problem is cast as a convex optimization problem for which we study and compare several proximal type methods. These algorithms have several interesting features, such as global convergence and stability with respect to the viscosity parameter, which can eventually be zero. We assess the performance of the methods via numerical experiments.
References in corpus (1)
Cited by in corpus (10)
- Primal dual methods for Wasserstein gradient flows
- Numerical methods for Mean field Games based on Gaussian Processes and Fourier Features
- Sparse Gaussian processes for solving nonlinear PDEs
- Analysis and Numerical Approximation of Stationary Second-Order Mean Field Game Partial Differential Inclusions
- Finite element approximation of time-dependent mean field games with nondifferentiable Hamiltonians
- A Simple Multiscale Method for Mean Field Games
- Mean Field LQG Social Optimization: A Reinforcement Learning Approach
- Perspective Functions: Properties, Constructions, and Examples
- Existence of weak solutions to first-order stationary mean-field games with Dirichlet conditions
- A projected primal-dual splitting for solving constrained monotone inclusions