Related papers: Deep Backward and Galerkin Methods for the Finite …
We present two distributed algorithms for the computation of a generalized Nash equilibrium in monotone games. The first algorithm follows from a forward-backward-forward operator splitting, while the second, which requires the…
Mean field games are concerned with the limit of large-population stochastic differential games where the agents interact through their empirical distribution. In the classical setting, the number of players is large but fixed throughout…
We consider an $N$-player game where the states of the players evolve with time as Stochastic Differential Equations (SDEs) with interaction only in the drift terms. Each player controls the drift of the SDE satisfied by her state process,…
We study mean field games and corresponding $N$-player games in continuous time over a finite time horizon where the position of each agent belongs to a finite state space. As opposed to previous works on finite state mean field games, we…
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 propose a numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs). Our algorithm estimates simultaneously by backward time induction the solution and its gradient by multi-layer neural…
In this paper, we present a numerical scheme to solve the initial-boundary value problem for backward stochastic partial differential equations of parabolic type. Based on the Galerkin method, we approximate the original equation by a…
We study Nash equilibria for a sequence of symmetric $N$-player stochastic games of finite-fuel capacity expansion with singular controls and their mean-field game (MFG) counterpart. We construct a solution of the MFG via a simple iterative…
We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only exchange information with some neighbors, although its cost function possibly depends on the strategies of all…
In this note, we develop Fourier approximation methods for the solutions of first-order nonlocal mean-field games (MFG) systems. Using Fourier expansion techniques, we approximate a given MFG system by a simpler one that is equivalent to a…
This paper studies the mean field game (MFG) problem arising from a large population competition in fund management, featuring a new type of relative performance via the benchmark tracking. In the $n$-player model, each agent aims to…
Mean field games (MFGs) describe the collective behavior of large populations of interacting agents. In this work, we tackle ill-posed inverse problems in potential MFGs, aiming to recover the agents' population, momentum, and environmental…
This paper proposes a new mathematical paradigm to analyze discrete-time mean-field games. It is shown that finding Nash equilibrium solutions for a general class of discrete-time mean-field games is equivalent to solving an optimization…
Neural network-based methods are effective for solving equilibria in Mean-Field Games (MFGs), particularly in high-dimensional settings. However, solving the coupled partial differential equations (PDEs) in MFGs limits their applicability…
Mean field type models describing the limiting behavior of stochastic differential games as the number of players tends to +$\infty$, have been recently introduced by J-M. Lasry and P-L. Lions. Under suitable assumptions, they lead to a…
In this article, we study the global-in-time well-posedness of second order mean field games (MFGs) with both nonlinear drift functions simultaneously depending on the state, distribution and control variables, and the diffusion term…
We solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone games with expected value cost functions. Specifically, we present the first distributed SGNE seeking algorithm for monotone games that requires one…
Option pricing often requires solving partial differential equations (PDEs). Although deep learning-based PDE solvers have recently emerged as quick solutions to this problem, their empirical and quantitative accuracy remain not well…
We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…
This paper studies two fundamental problems in regularized Graphon Mean-Field Games (GMFGs). First, we establish the existence of a Nash Equilibrium (NE) of any $\lambda$-regularized GMFG (for $\lambda\geq 0$). This result relies on weaker…