Related papers: Displacement convexity for first-order mean-field …
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We present a survey on several mass transportation problems, in which a given mass dynamically moves from an initial configuration to a final one. The approach we consider is the one introduced by Benamou and Brenier in [5], where a…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
This paper introduces a framework of Constrained Mean-Field Games (CMFGs), where each agent solves a constrained Markov decision process (CMDP). This formulation captures scenarios in which agents' strategies are subject to feasibility,…
This paper is devoted to finite horizon deterministic mean field games in which the state space is a network. The agents control their velocity, and when they occupy a vertex, they can enter into any incident edge. The running and terminal…
We propose and investigate a general class of discrete time and finite state space mean field game (MFG) problems with potential structure. Our model incorporates interactions through a congestion term and a price variable. It also allows…
Here, we observe that mean-field game (MFG) systems admit a two-player infinite-dimensional general-sum differential game formulation. We show that particular regimes of this game reduce to previously known variational principles.…
This paper studies a mean field game inspired by crowd motion in which agents evolve in a compact domain and want to reach its boundary minimizing the sum of their travel time and a given boundary cost. Interactions between agents occur…
We study the convergence problem for mean field games with common noise and controlled volatility. We adopt the strategy recently put forth by Lauri\`ere and the second author, using the maximum principle to recast the convergence problem…
We consider minimization problems for curves of measure, with kinetic and potential energy and a congestion penalization, as in the functionals that appear in Mean Field Games with a variational structure. We prove L infinity regularity…
We study mean-field game (MFG) problems with rough common noise, in which the representative state dynamics are governed by a controlled rough stochastic differential equation driven by an idiosyncratic Brownian motion and a deterministic…
We study the singular perturbation problem for mean field game systems with control of acceleration. For such a problem we analyze the behavior of solutions as the acceleration costs vanishes. In this setting the Hamiltonian fails to be…
In this paper, we characterize the asymptotic behavior of a first-order stationary mean-field game (MFG) with a logarithm coupling, a quadratic Hamiltonian, and a periodically oscillating potential. This study falls into the realm of the…
The push-forward operation enables one to redistribute a probability measure through a deterministic map. It plays a key role in statistics and optimization: many learning problems (notably from optimal transport, generative modeling, and…
In this paper, we study two kinds of inverse problems for Mean Field Games (MFGs) with common noise. Our focus is on MFGs described by a coupled system of stochastic Hamilton-Jacobi-Bellman and Fokker-Planck equations. Firstly, we establish…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
Departure time choice models play a crucial role in determining the traffic load in transportation systems. This paper introduces a new framework to model and analyze the departure time user equilibrium (DTUE) problem based on the so-called…
Mean field games (MFG) and mean field control (MFC) are critical classes of multi-agent models for efficient analysis of massive populations of interacting agents. Their areas of application span topics in economics, finance, game theory,…
In this manuscript we derive a new nonlinear transport equation written on the space of probability measures that allows to study a class of deterministic mean field games and master equations, where the interaction of the agents happens…
Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints.…