Related papers: Convexification for a Coefficient Inverse Problem …
We propose a novel mean field games (MFGs) based GAN(generative adversarial network) framework. To be specific, we utilize the Hopf formula in density space to rewrite MFGs as a primal-dual problem so that we are able to train the model via…
Recovering microscopic couplings directly from data provides a route to solving the inverse problem in statistical field theories, one that complements the traditional-often computationally intractable-forward approach of predicting…
We analyze a (possibly degenerate) second order mean field games system of partial differential equations. The distinguishing features of the model considered are (1) that it is not uniformly parabolic, including the first order case as a…
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strategies for both players and can be solved in…
This paper investigates a mean-field game (MFG) problem for mean-variance (MV) portfolio management, highlighting a new type of relative performance encoded by the peer-based risk aversion. Specifically, the risk aversion is formulated as a…
Mean field games models describing the limit of a large class of stochastic differential games, as the number of players goes to $+\infty$, have been introduced by J.-M. Lasry and P.-L. Lions. We use a change of variables to transform the…
The recent mean field game (MFG) formalism has enabled the application of inverse reinforcement learning (IRL) methods in large-scale multi-agent systems, with the goal of inferring reward signals that can explain demonstrated behaviours of…
Here, we study radial solutions for first- and second-order stationary Mean-Field Games (MFG) with congestion on $\mathbb{R}^d$. MFGs with congestion model problems where the agents' motion is hampered in high-density regions. The radial…
This manuscript discusses planning problems for first- and second-order one-dimensional mean-field games (MFGs). These games are comprised of a Hamilton-Jacobi equation coupled with a Fokker-Planck equation. Applying Poincar\'e's Lemma to…
We study convergence rates of the generalized conditional gradient (GCG) method applied to fully discretized Mean Field Games (MFG) systems. While explicit convergence rates of the GCG method have been established at the continuous PDE…
We introduce Mean-Field Game (MFG) epidemiological models, in which immunity either wanes with time in a fully observable way or disappears instantaneously with no direct observation (making a previously recovered individual fully…
This paper explores the use of Maximum Causal Entropy Inverse Reinforcement Learning (IRL) within the context of discrete-time stationary Mean-Field Games (MFGs) characterized by finite state spaces and an infinite-horizon,…
We consider deterministic mean field games where the dynamics of a typical agent is non-linear with respect to the state variable and affine with respect to the control variable. Particular instances of the problem considered here are mean…
We introduce two Smoothed Policy Iteration algorithms (\textbf{SPI}s) as rules for learning policies and methods for computing Nash equilibria in second order potential Mean Field Games (MFGs). Global convergence is proved if the coupling…
A mean-field game (MFG) seeks the Nash Equilibrium of a game involving a continuum of players, where the Nash Equilibrium corresponds to a fixed point of the best-response mapping. However, simple fixed-point iterations do not always…
We investigate multi-agent imitation learning (IL) within the framework of mean field games (MFGs), considering the presence of time-varying correlated signals. Existing MFG IL algorithms assume demonstrations are sampled from Mean Field…
Mean field games (MFG) and mean field control problems (MFC) are frameworks to study Nash equilibria or social optima in games with a continuum of agents. These problems can be used to approximate competitive or cooperative games with a…
The paper considers a forward-backward system of parabolic PDEs arising in a Mean Field Game (MFG) model where every agent controls the drift of a trajectory subject to Brownian diffusion, trying to escape a given bounded domain $\Omega$ in…
After a brief introduction to one of the most typical problems in Mean Field Games, the congestion case (where agents pay a cost depending on the density of the regions they visit), and to its variational structure, we consider the question…
Mean-field Games systems (MFGs) serve as paradigms to describe the games among a huge number of players. In this paper, we consider the ergodic Mean-field Games systems in the bounded domain with Neumann boundary conditions and the…