Related papers: Displacement convexity for first-order mean-field …
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…
The displacement $\lambda$-convexity of a nonstandard entropy with respect to a nonlocal transportation metric in finite state spaces is shown using a gradient flow approach. The constant $\lambda$ is computed explicitly in terms of a…
This paper considers mean field games with optimal stopping time (OSMFGs) where agents make optimal exit decisions, the coupled obstacle and Fokker-Planck equations in such models pose challenges versus classic MFGs. This paper proposes a…
This paper presents a Mean Field Game (MFG) model for maritime traffic flow, treating the navigation of ships between seaports as a large-scale stochastic control problem. The MFG framework enables the modeling of agents at a microscopic…
In the present work, we study deterministic mean field games (MFGs) with finite time horizon in which the dynamics of a generic agent is controlled by the acceleration. They are described by a system of PDEs coupling a continuity equation…
Recent techniques based on Mean Field Games (MFGs) allow the scalable analysis of multi-player games with many similar, rational agents. However, standard MFGs remain limited to homogeneous players that weakly influence each other, and…
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 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,…
Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
In this article, we study a simplified version of a density-dependent first-order mean field game, in which the players face a penalization equal to the population density at their final position. We consider the problem of finding an…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
In this paper we establish quantitative convergence results for both open and closed-loop Nash equilibria of N-player stochastic differential games in the setting of Mean Field Games of Controls (MFGC), a class of models where interactions…
In this paper, we study a class of degenerate mean field games (MFGs) with state-distribution dependent and unbounded functional diffusion coefficients. With a probabilistic method, we study the well-posedness of the forward-backward…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
This paper addresses congested transport, which can be described, at macroscopic scales, by a continuity equation with a pressure variable generated from the hard-congestion constraint (maximum value of the density). The main goal of the…
Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this context, we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global…
In this paper, we propose and study an inverse boundary problem for the mean field games (MFGs) governed by the first-order master equation in a bounded domain. We establish the unique identifiability result by showing that the running cost…
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…
Motivated by numerical challenges in first-order mean field games (MFGs) and the weak noise theory for the Kardar-Parisi-Zhang equation, we consider the problem of vanishing viscosity approximations for MFGs. We provide the first results on…