Related papers: On non-uniqueness in mean field games
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…
This paper studies the convergence problem for mean field games with common noise. We define a suitable notion of weak mean field equilibria, which we prove captures all subsequential limit points, as $n\to\infty$, of closed-loop…
In this article, we establish precise convergence rates of a general class of $N$-Player Stackelberg games to their mean field limits, which allows the response time delay of information, empirical distribution based interactions, and the…
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…
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…
Mean field type models describing the limiting behavior, as the number of players tends to $+\infty$, of stochastic differential game problems, have been recently introduced by J-M. Lasry and P-L. Lions. Numerical methods for the…
This paper proposes a multiscale method for solving the numerical solution of mean field games which accelerates the convergence and addresses the problem of determining the initial guess. Starting from an approximate solution at the…
The goal of the paper is to introduce a set of problems which we call mean field games of timing. We motivate the formulation by a dynamic model of bank run in a continuous-time setting. We briefly review the economic and game theoretic…
We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the…
This paper investigates the well-posedness of a type of state constraint ergodic Mean Field Game system in a bounded domain in which the Hamilton-Jacobi-Bellman equation is paired with an infinite Dirichlet boundary condition. In this…
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…
This paper is interested in the problem of optimal stopping in a mean field game context. The notion of mixed solution is introduced to solve the system of partial differential equations which models this kind of problem. This notion…
We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…
A theory of existence and uniqueness is developed for general stochastic differential mean field games with common noise. The concepts of strong and weak solutions are introduced in analogy with the theory of stochastic differential…
We consider continuous-time mean-field stochastic games with strategic complementarities. The interaction between the representative productive firm and the population of rivals comes through the price at which the produced good is sold and…
Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of iterations…
We introduce and analyze a new finite-difference scheme, relying on the theta-method, for solving monotone second-order mean field games. These games consist of a coupled system of the Fokker-Planck and the Hamilton-Jacobi-Bellman equation.…
We introduce a zero-sum game problem of mean-field type as an extension of the classical zero-sum Dynkin game problem to the case where the payoff processes might depend on the value of the game and its probability law. We establish…
We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a…
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…