Related papers: Solving Mean-Field Games with Monotonicity Methods…
In this paper, we study first-order stationary monotone mean-field games (MFGs) with Dirichlet boundary conditions. While for Hamilton--Jacobi equations Dirichlet conditions may not be satisfied, here, we establish the existence of…
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…
This chapter examines monotonicity techniques in the theory of mean-field games(MFGs). Originally, monotonicity ideas were used to establish the uniqueness of solutions for MFGs. Later, monotonicity methods and monotone operators were…
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 initial and terminal conditions. To construct…
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.…
This paper introduces a notion of weak solution for the coupled system of master equations in mean field games with a major player. It extends the previously introduced notion of Lipschitz solutions in mean field games. By relying on a…
We extend the weak-strong uniqueness principle for mean-field game (MFG) systems to a broad class of second-order stationary and time-dependent problems. Under standard monotonicity, growth, and coercivity assumptions on the Hamiltonian,…
This paper is concerned with extending the notion of monotone solution to the mean field game (MFG) master equation to situations in which the coefficients are displacement monotone, instead of the previously introduced notion in the flat…
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…
This paper addresses the crucial question of solution uniqueness in stationary first-order Mean-Field Games (MFGs). Despite well-established existence results, establishing uniqueness, particularly for weaker solutions in the sense of…
Mean-field games (MFGs) are models of large populations of rational agents who seek to optimize an objective function that takes into account their location and the distribution of the remaining agents. Here, we consider stationary MFGs…
This paper studies a one-dimensional Mean-Field Planning (MFP) system with a non-local, rank-based coupling. Using a potential formulation, we rewrite the system as an associated scalar partial differential equation. We prove an equivalence…
This paper investigates stationary mean-field games (MFGs) on the torus with Lipschitz non-homogeneous diffusion and logarithmic-like couplings. The primary objective is to understand the existence of $C^{1,\alpha}$ solutions to address the…
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…
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…
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 class of local, first-order, stationary mean-field games (MFGs) on bounded domains with nonstandard mixed boundary conditions: prescribed inflow on $\Gamma_N$ and a relaxed Signorini-type exit condition on $\Gamma_D$…
Mean field games (MFGs) offer a powerful framework for modeling large-scale multi-agent systems. This paper addresses MFGs formulated in continuous time with discrete state spaces, where agents' dynamics are governed by continuous-time…
Here, we prove the existence of solutions to first-order mean-field games (MFGs) arising in optimal switching. First, we use the penalization method to construct approximate solutions. Then, we prove uniform estimates for the penalized…
Here, we prove the existence of smooth solutions for mean-field games with a singular mean-field coupling; that is, a coupling in the Hamilton-Jacobi equation of the form $g(m)=-m^{-\alpha}$. We consider stationary and time-dependent…