Related papers: On Sustainable Equilibria
In this paper we consider strong Nash equilibria, in mixed strategies, for finite games. Any strong Nash equilibrium outcome is Pareto efficient for each coalition. First, we analyze the two--player setting. Our main result, in its simplest…
We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple communication mechanism consisting in reporting the…
McLennan and Tourky (2010) showed that "imitation games" provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke-Howson algorithm. In an imitation game, the payoff matrix of one of the players is the…
This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…
Nash equilibrium is a key concept in game theory fundamental for elucidating the equilibrium state of strategic interactions, finding applications in diverse fields such as economics, political science, and biology. However, the Nash…
Real populations are seldom found at the Nash equilibrium strategy. The present work focuses on how population size can be a relevant evolutionary force diverting the population from its expected Nash equilibrium. We introduce the concept…
We consider games of strategic substitutes and strategic complements on networks. We introduce two different evolutionary dynamics in order to refine their multiplicity of equilibria, and we analyse the system through a mean field approach.…
One could observe drastically different dynamics of zero-sum and non-zero-sum games under replicator equations. In zero-sum games, heteroclinic cycles naturally occur whenever the species of the population supersede each other in a cyclic…
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,…
An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…
While fictitious play is guaranteed to converge to Nash equilibrium in certain game classes, such as two-player zero-sum games, it is not guaranteed to converge in non-zero-sum and multiplayer games. We show that fictitious play in fact…
Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that…
In this paper, we introduce a novel equilibrium concept, called the equilibrium cycle, which seeks to capture the outcome of oscillatory game dynamics. Unlike the (pure) Nash equilibrium, which defines a fixed point of mutual best…
We give a simple proof of the well-known result that the marginal strategies of a coarse correlated equilibrium form a Nash equilibrium in two-player zero-sum games. A corollary of this fact is that no-external-regret learning algorithms…
A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an $\epsilon$-Nash equilibrium if no player can gain more than $\epsilon$ by…
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that…
Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an…
A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information…
Establishing the existence of exact or near Markov or stationary perfect Nash equilibria in nonzero-sum Markov games over Borel spaces is a challenging problem with limited positive results. Motivated by problems in multi-agent and Bayesian…
This paper analyses two-player nonzero-sum games of optimal stopping on a class of linear regular diffusions with not non-singular boundary behaviour (in the sense of It\^o and McKean (1974), p.\ 108). We provide sufficient conditions under…