Related papers: A semi-discrete approximation for first-order stat…
In this work we propose a fully-discrete Semi-Lagrangian scheme for a {\it first order mean field game system}. We prove that the resulting discretization admits at least one solution and, in the scalar case, we prove a convergence result…
This article focuses two issues related to the first-order discounted mean field games system. The first is the time discretization problem. The time discretization approach enables us to prove the existence of solutions (u,m) of the…
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…
In this work, we consider a first order mean field games system with non-local couplings. A Lagrange-Galerkin scheme for the continuity equation, coupled with a semi-Lagrangian scheme for the Hamilton-Jacobi-Bellman equation, is proposed to…
We study a particle approximation for one-dimensional first-order Mean-Field-Games (MFGs) with local interactions with planning conditions. Our problem comprises a system of a Hamilton-Jacobi equation coupled with a transport equation. As…
We consider Mean Field Games without idiosyncratic but with Brownian type common noise. We introduce a notion of solutions of the associated backward-forward system of stochastic partial differential equations. We show that the solution…
The paper is devoted to the first-order mean field game system in the case when the distribution of players can contain atoms. The proposed definition of a generalized solution is based on the minimax approach to the Hamilton-Jacobi…
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…
We consider a system of mean field games with local coupling in the deterministic limit. Under general structure conditions on the Hamiltonian and coupling, we prove existence and uniqueness of the weak solution, characterizing this…
Quasi-stationary Mean Field Games models consider agents who base their strategies on current information without forecasting future states. In this paper we address the first-order quasi-stationary Mean Field Games system, which involves…
We prove stochastic homogenization for a class of non-convex and non-coercive first-order Hamilton-Jacobi equations in a finite-range-dependence environment for Hamiltonians that can be expressed by a max-min formula. Exploiting the…
This work focuses on the rate of convergence for singular perturbation problems for first-order Hamilton-Jacobi equations. As an application we derive the rate of convergence for singularly perturbed two-players zero-sum deterministic…
Here, we consider a regularized mean-field game model that features a low-order regularization. We prove the existence of solutions with positive density. To do so, we combine a priori estimates with the continuation method. In contrast…
In this paper we construct short time classical solutions to a class of master equations in the presence of non-degenerate individual noise arising in the theory of mean field games. The considered Hamiltonians are non-separable and $local$…
First, we study the existence of solutions for a class of first order mean field games systems \begin{equation*} \left\{\begin{aligned} &H(x,u,Du)=F(x,m(t)),\quad &&x\in M,\ \forall\ t\in[0,T],\\ &\partial_t…
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 in calculus of variations, and in the study of…
We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence…
We prove a rate of convergence for finite element approximations of stationary, second-order mean field games with nondifferentiable Hamiltonians posed in general bounded polytopal Lipschitz domains with strongly monotone running costs. In…
In this note we propose a transformation which decouples stationary Mean Field Games systems with superlinear Hamiltonians of the form |p|^r, and turns the Hamilton-Jacobi-Bellman equation into a quasi-linear equation involving the…
The standard formulation of the PDE system of Mean Field Games (MFG) requires the differentiability of the Hamiltonian. However in many cases, the structure of the underlying optimal problem leads to a convex but nondifferentiable…