Related papers: A Lagrange-Galerkin scheme for first order mean fi…
In this paper we present a numerical scheme to solve coupled mean field forward-backward stochastic differential equations driven by monotone vector fields. This is based on an adaptation of so called extragradient methods by characterizing…
We study the asymptotic behavior of solutions to the constrained MFG system as the time horizon $T$ goes to infinity. For this purpose, we analyze first Hamilton-Jacobi equations with state constraints from the viewpoint of weak KAM theory,…
We provide an existence result for stationary fractional mean field game systems, with fractional exponent greater than 1/2. In the case in which the coupling is a nonlocal regularizing potential, we obtain existence of solutions under…
While the general theory for the terminal-initial value problem for mean-field games (MFGs) has achieved a substantial progress, the corresponding forward-forward problem is still poorly understood - even in the one-dimensional setting.…
This paper represents the first attempt to develop a theory for linear-quadratic mean field games in possibly infinite dimensional Hilbert spaces. As a starting point, we study the case, considered in most finite dimensional contributions…
The paper studies the convergence, as $N$ tends to infinity, of a system of $N$ coupled Hamilton-Jacobi equations, the Nash system. This system arises in differential game theory. We describe the limit problem in terms of the so-called…
This paper establishes a primal-dual formulation for continuous-time mean field games (MFGs) and provides a complete analytical characterization of the set of all Nash equilibria (NEs). We first show that for any given mean field flow, the…
We investigate the resolution of second-order, potential, and monotone mean field games with the generalized conditional gradient algorithm, an extension of the Frank-Wolfe algorithm. We show that the method is equivalent to the fictitious…
We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further…
We investigate time dependent, first order Mean Field Games on the torus comparing, in a broad and general framework, the classical differential formulation , given by a Hamilton Jacobi equation coupled with a continuity equation, with a…
We investigate mean field game systems under invariance conditions for the state space, otherwise called {\it viability conditions} for the controlled dynamics. First we analyze separately the Hamilton-Jacobi and the Fokker-Planck…
We study the regularity and well-posedness of the local, first-order forward-backward mean field games system, assuming a polynomially growing cost function and a Hamiltonian of quadratic growth. We consider systems and terminal data that…
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…
In a discrete space and time framework, we study the mean field game limit for a class of symmetric $N$-player games based on the notion of correlated equilibrium. We give a definition of correlated solution that allows to construct…
We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean…
We analyse fully nonlinear second-order mean field games (MFG) with nondifferentiable Hamiltonians, which take the form of a coupled system of a fully nonlinear Hamilton-Jacobi-Bellman equation and a Kolmogorov-Fokker-Planck partial…
We extend the methods from Nurbekyan, Saude "Fourier approximation methods for first-order nonlocal mean-field games" [Port. Math. 75 (2018), no. 3-4] and Liu, Jacobs, Li, Nurbekyan, Osher "Computational methods for nonlocal mean field…
We use the Markov chain approximation method to construct approximations for the solution of the mean field game (MFG) with reflecting barriers studied in Bayraktar, Budhiraja, and Cohen (2017). The MFG is formulated in terms of a…
In this paper, we introduce and study a first-order mean-field game obstacle problem. We examine the case of local dependence on the measure under assumptions that include both the logarithmic case and power-like nonlinearities. Since the…
We consider the numerical solution of Hamilton-Jacobi-Bellman equations arising in stochastic control theory. We introduce a class of monotone approximation schemes relying on monotone interpolation. These schemes converge under very weak…