Corpus ID: 237940331

Discrete Approximation Of Stationary Mean Field Games

@inproceedings{Bakaryan2021DiscreteAO,
  title={Discrete Approximation Of Stationary Mean Field Games},
  author={Tigran K. Bakaryan and Diogo A. Gomes and H'ector S'anchez Morgado},
  year={2021}
}
Abstract. In this paper, we focus on stationary (ergodic) mean-field games (MFGs). These games arise in the study of the long-time behavior of finite-horizon MFGs. Motivated by a prior scheme for Hamilton–Jacobi equations introduced in Aubry–Mather’s theory, we introduce a discrete approximation to stationary MFGs. Relying on Kakutani’s fixed-point theorem, we prove the existence and uniqueness (up to additive constant) of solutions to the discrete problem. Moreover, we show that the solutions… Expand

References

SHOWING 1-10 OF 47 REFERENCES
Regularity for second order stationary mean-field games
In this paper, we prove the existence of classical solutions for second order stationary mean-field game systems. These arise in ergodic (mean-field) optimal control, convex degenerate problems inExpand
On the existence of classical solutions for stationary extended mean field games
Abstract In this paper we consider extended stationary mean-field games, that is mean-field games which depend on the velocity field of the players. We prove various a-priori estimates whichExpand
Existence of weak solutions to time-dependent mean-field games.
Here, we establish the existence of weak solutions to a wide class of time-dependent monotone mean-field games (MFGs). These MFGs are given as a system of degenerate parabolic equations with initialExpand
Existence of Weak Solutions to Stationary Mean-Field Games through Variational Inequalities
TLDR
These methods provide a general framework to construct weak solutions to stationary MFGs with local, nonlocal, or congestion terms and establish the existence of solutions for the original MFG using Minty's method. Expand
A semi-discrete approximation for a first order mean field game problem
TLDR
A semi-discrete infitime approximation of the model first order mean field game problem is proposed and it is proved that it is well posed and that it converges to (v;m) when the discretization parameter tends to zero. Expand
Existence of weak solutions to first-order stationary mean-field games with Dirichlet conditions
In this paper, we study first-order stationary monotone mean-field games (MFGs) with Dirichlet boundary conditions. Whereas Dirichlet conditions may not be satisfied for Hamilton–Jacobi equations,Expand
Two Numerical Approaches to Stationary Mean-Field Games
Here, we consider numerical methods for stationary mean-field games (MFG) and investigate two classes of algorithms. The first one is a gradient-flow method based on the variational characterizationExpand
Discrete-time average-cost mean-field games on Polish spaces
TLDR
It is shown that the equilibrium policy in the mean-field game, when adopted by each agent, is an approximate Nash equilibrium for the corresponding finite-agent game with sufficiently many agents. Expand
A variational approach to second order mean field games with density constraints: the stationary case
In this paper we study second order stationary Mean Field Game systems under density constraints on a bounded domain $\Omega \subset \mathbb{R}^d$. We show the existence of weak solutions forExpand
Mean field games with congestion
We consider a class of systems of time dependent partial differential equations which arise in mean field type models with congestion. The systems couple a backward viscous Hamilton-Jacobi equationExpand
...
1
2
3
4
5
...