Related papers: Proximal methods for stationary Mean Field Games w…
In this paper we provide the existence of classical solutions to stationary mean field game systems in the whole space $\mathbb{R}^N$, with coercive potential, aggregating local coupling, and under general conditions on the Hamiltonian,…
In this article, we introduce a method to approximate solutions of some variational mean field game problems with congestion, by finite sets of player trajectories. These trajectories are obtained by solving a minimization problem similar…
First order kinetic mean field games formally describe the Nash equilibria of deterministic differential games where agents control their acceleration, asymptotically in the limit as the number of agents tends to infinity. The known results…
In this paper we provide the existence of classical solutions to stationary mean field game systems in the whole space $\mathbb{R}^N$, with coercive potential and aggregating local coupling, under general conditions on the Hamiltonian. The…
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 for power-like Hamiltonians with arbitrary order of…
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 stationary viscous Mean-Field Games systems in the case of local, decreasing and unbounded coupling. These systems arise in ergodic mean-field game theory, and describe Nash equilibria of games with a large number of agents…
The formulation of Mean Field Games (MFG) typically requires continuous differentiability of the Hamiltonian in order to determine the advective term in the Kolmogorov--Fokker--Planck equation for the density of players. However, in many…
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…
We consider the variational approach to prove the existence of solutions of second order stationary Mean Field Games on a bounded domain $\Omega\subseteq \mathbb{R}^{d}$, with Neumann boundary conditions, and with and without density…
We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal…
We study the existence of classical solutions to a broad class of local, first order, forward-backward Extended Mean Field Games systems, that includes standard Mean Field Games, Mean Field Games with congestion, and mean field type control…
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…
Mean-field games (MFGs) are models for large populations of competing rational agents that seek to optimize a suitable functional. In the case of congestion, this functional takes into account the difficulty of moving in high-density areas.…
We construct numerical approximations for Mean Field Games with fractional or nonlocal diffusions. The schemes are based on semi-Lagrangian approximations of the underlying control problems/games along with dual approximations of the…
Here, we consider stationary monotone mean-field games (MFGs) and study the existence of weak solutions. First, we introduce a regularized problem that preserves the monotonicity. Next, using variational inequalities techniques, we prove…
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…
We provide an approximation scheme for first-order stationary mean field games with a separable Hamiltonian. First, we discretize Hamilton-Jacobi equations by discretizing in time, and then prove the existence of minimizing holonomic…
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…
We prove well-posedness of a class of kinetic-type Mean Field Games, which typically arise when agents control their acceleration. Such systems include independent variables representing the spatial position as well as velocity. We consider…