6,567 research outputs found
Monotone methods for equilibrium selection under perfect foresight dynamics
This paper studies equilibrium selection in supermodular games
based on perfect foresight dynamics. A normal form game is played
repeatedly in a large society of rational agents. There are frictions:
opportunities to revise actions follow independent Poisson processes.
Each agent forms his belief about the future evolution of action distribution
in the society to take an action that maximizes his expected
discounted payo�. A perfect foresight path is de�ned to be a feasible
path of the action distribution along which every agent with a revision
opportunity takes a best response to this path itself. A Nash
equilibrium is said to be absorbing if there exists no perfect foresight
path escaping from a neighborhood of this equilibrium; a Nash equilibrium
is said to be globally accessible if for each initial distribution,
there exists a perfect foresight path converging to this equilibrium.
By exploiting the monotone structure of the dynamics, a unique Nash
equilibrium that is absorbing and globally accessible for any small degree
of friction is identi�ed for certain classes of supermodular games.
For games with monotone potentials, the selection of the monotone
potential maximizer is obtained. Complete characterizations of absorbing
equilibrium and globally accessible equilibrium are given for
binary supermodular games. An example demonstrates that unanimity
games may have multiple globally accessible equilibria for a small
friction
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
We introduce a class of finite strategic games with the property that every
deviation of a coalition of players that is profitable to each of its members
strictly decreases the lexicographical order of a certain function defined on
the set of strategy profiles. We call this property the Lexicographical
Improvement Property (LIP) and show that it implies the existence of a
generalized strong ordinal potential function. We use this characterization to
derive existence, efficiency and fairness properties of strong Nash equilibria.
We then study a class of games that generalizes congestion games with
bottleneck objectives that we call bottleneck congestion games. We show that
these games possess the LIP and thus the above mentioned properties. For
bottleneck congestion games in networks, we identify cases in which the
potential function associated with the LIP leads to polynomial time algorithms
computing a strong Nash equilibrium. Finally, we investigate the LIP for
infinite games. We show that the LIP does not imply the existence of a
generalized strong ordinal potential, thus, the existence of SNE does not
follow. Assuming that the function associated with the LIP is continuous,
however, we prove existence of SNE. As a consequence, we prove that bottleneck
congestion games with infinite strategy spaces and continuous cost functions
possess a strong Nash equilibrium
One for all, all for one---von Neumann, Wald, Rawls, and Pareto
Applications of the maximin criterion extend beyond economics to statistics,
computer science, politics, and operations research. However, the maximin
criterion---be it von Neumann's, Wald's, or Rawls'---draws fierce criticism due
to its extremely pessimistic stance. I propose a novel concept, dubbed the
optimin criterion, which is based on (Pareto) optimizing the worst-case payoffs
of tacit agreements. The optimin criterion generalizes and unifies results in
various fields: It not only coincides with (i) Wald's statistical
decision-making criterion when Nature is antagonistic, (ii) the core in
cooperative games when the core is nonempty, though it exists even if the core
is empty, but it also generalizes (iii) Nash equilibrium in -person
constant-sum games, (iv) stable matchings in matching models, and (v)
competitive equilibrium in the Arrow-Debreu economy. Moreover, every Nash
equilibrium satisfies the optimin criterion in an auxiliary game
From Nash to Cournot-Nash equilibria via the Monge-Kantorovich problem
The notion of Nash equilibria plays a key role in the analysis of strategic
interactions in the framework of player games. Analysis of Nash equilibria
is however a complex issue when the number of players is large. In this article
we emphasize the role of optimal transport theory in: 1) the passage from Nash
to Cournot-Nash equilibria as the number of players tends to infinity, 2) the
analysis of Cournot-Nash equilibria
Ordinal Games
We study strategic games where players' preferences are weak orders which need not admit utility representations. First of all, we ex- tend Voorneveld's concept of best-response potential from cardinal to ordi- nal games and derive the analogue of his characterization result: An ordi- nal game is a best-response potential game if and only if it does not have a best-response cycle. Further, Milgrom and Shannon's concept of quasi- supermodularity is extended from cardinal games to ordinal games. We ¯nd that under certain compactness and semicontinuity assumptions, the ordinal Nash equilibria of a quasi-supermodular game form a nonempty complete lattice. Finally, we extend several set-valued solution concepts from cardinal to ordinal games in our sense.Ordinal Games, Potential Games, Quasi-Supermodularity, Rationalizable Sets, Sets Closed under Behavior Correspondences
- …