Related papers: Mild and weak solutions of Mean Field Games proble…
We consider a class of N-player stochastic games of multi-dimensional singular control, in which each player faces a minimization problem of monotone-follower type with submodular costs. We call these games "monotone-follower games". In a…
This paper revisits the well-studied \emph{optimal stopping} problem but within the \emph{large-population} framework. In particular, two classes of optimal stopping problems are formulated by taking into account the \emph{relative…
We consider mean field games with ergodic cost in the framework of a general discrete time controlled Markov processes. The state space of the processes is given by a general $\sigma$-compact Polish space. Under certain conditions, we show…
Mean Field Games with state constraints are differential games with infinitely many agents, each agent facing a constraint on his state. The aim of this paper is to provide a meaning of the PDE system associated with these games, the…
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…
The standard game-theoretic solution concept, Nash equilibrium, assumes that all players behave rationally. If we follow a Nash equilibrium and opponents are irrational (or follow strategies from a different Nash equilibrium), then we may…
We consider time-dependent viscous Mean-Field Games systems in the case of local, decreasing and unbounded coupling. These systems arise in mean-field game theory, and describe Nash equilibria of games with a large number of agents aiming…
We consider stationary viscous Mean-Field Games systems in the case of local, decreasing and unbounded coupling. These systems arise in ergodic mean-field game theory, and describe Nash equilibria of games with a large number of agents…
Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However,…
Nash Equilibrium (NE) is the canonical solution concept of game theory, which provides an elegant tool to understand the rationalities. Though mixed strategy NE exists in any game with finite players and actions, computing NE in two- or…
We consider a symmetric $n$-player nonzero-sum stochastic differential game with controlled jumps and mean-field type interaction among the players. Each player minimizes some expected cost by affecting the drift as well as the jump part of…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
Mean field games are studied in the framework of controlled martingale problems, and general existence theorems are proven in which the equilibrium control is Markovian. The framework is flexible enough to include degenerate volatility,…
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…
In this paper we study second order master equations arising from mean field games with common noise over arbitrary time duration. A classical solution typically requires the monotonicity condition (or small time duration) and sufficiently…
In this paper, we study the well-posedness (existence and uniqueness) of the Master Equation of Mean Field Games under invariance-type conditions, otherwise known as viability conditions for the controlled dynamics. The interior regularity…
This paper considers decentralized control and optimization methodologies for large populations of systems, consisting of several agents with different individual behaviors, constraints and interests, and affected by the aggregate behavior…
We study stochastic mean-field games among finite number of teams with large finite as well as infinite number of decision makers. For this class of games within static and dynamic settings, we establish the existence of a Nash equilibrium,…
Finding Nash equilibria in two-player zero-sum continuous games is a central problem in machine learning, e.g. for training both GANs and robust models. The existence of pure Nash equilibria requires strong conditions which are not…
The recently defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a finite set of linear constraints together with integer…