Equivalence of strong and coalition-proof Nash equilibria in games without spillovers

Summary This paper examines the conditions which guarantee that the set of coalition-proof Nash equilibria coincides with the set of strong Nash equilibria in the normal form games withoutspillovers. We find thatpopulation monotonicity properties of the payoff functions, when the payoff of a player changes monotonically when the size of the group of players choosing the same strategy increases, are crucial to obtain the equivalence of these two solution concepts. We identify the classes of games, satisfying population monotonicity properties, which yield the equivalence of the set of coalition-proof Nash equilibria and the set of strong Nash equilibria. We also provide sufficient conditions for the equivalence result even when the population monotonicity assumptions are relaxed.We wish to thank Mamoru Kaneko, Akihiko Matsui, Tomoichi Shinotsuka, Benyamin Shitoviz, Tayfun Sonmez, William Thomson, the participants of the Southeastern Economic Theory Meeting in Charlottesville and the seminars at CORE and University of Tsukuba for useful discussions and comments. Our special thanks due anonymous referee for the suggestion to add a section addressing the issue of existence of a strong Nash equilibrium.     

The power of ESS: An experimental study

Abstract. Our experimental design mimics a traditional evolutionary game framework where players are matched pairwise to play a symmetric 33 bimatrix game that has two Nash equilibria. One equilibrium is an evolutionary stable state, or ESS; the other is an equilibrium in dominated strategies. Our primary experimental result is the observation that the ESS becomes extremely attractive when subjects have minimal information about the payoff functions, although the dominated equilibrium assures the highest equilibrium payoff. The attractiveness of the ESS is only moderate when players are completely informed about the 33 payoff matrix. Correspondence to: S.K. Berninghaus     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

An Axiomatization of Nash Equilibria in Economic Situations

We consider the class of all abstract economies with convex and compact strategy sets, continuous and quasi-concave payoff functions, and continuous and convex-valued feasibility correspondences. We prove that the Nash correspondence is the unique solution on the foregoing class of abstract economies that satisfies nonemptiness, rationality in one-person economies, and consistency.Journal of Economic LiteratureClassification Numbers: C72, D50.     

Excess payoff dynamics and other well-behaved evolutionary dynamics

We consider a model of evolution in games in which agents occasionally receive opportunities to switch strategies, choosing between them using a probabilistic rule. Both the rate at which revision opportunities arrive and the probabilities with which each strategy is chosen are functions of current normalized payoffs. We call the aggregate dynamics induced by this model excess payoff dynamics. We show that every excess payoff dynamic is well-behaved: regardless of the underlying game, each excess payoff dynamic admits unique solution trajectories that vary continuously with the initial state, identifies rest points with Nash equilibria, and respects a basic payoff monotonicity property. We show how excess payoff dynamics can be used to construct well-behaved modifications of imitative dynamics, and relate them to two other well-behaved dynamics based on projections.     

Pure Strategy Nash Equilibrium in a Group Formation Game with Positive Externalities

This paper identifies a domain of payoff functions inno spillovernoncooperative games withPositive externalitywhich admit a pure strategy Nash equilibrium. Since in general a Nash equilibrium may fail to exist, in order to guarantee the existence of an equilibrium, we impose two additional assumptions,AnonymityandOrder preservation. The proof of our main result is carried out by constructing, for a given gameG, a potential function Ψ over the set of strategy profiles in such a way that the maximum of Ψ yields a Nash equilibrium in pure strategies ofG.Journal of Economics LiteratureClassification Numbers: C72, D62, H73.     

A general structure theorem for the Nash equilibrium correspondence

I consider n-person normal form games where the strategy set of each player is a non-empty compact convex subset of an Euclidean space, and the payoff function of player i is continuous in joint strategies and continuously differentiable and concave in the player i's strategy. No further restrictions (such as multilinearity of the payoff functions or the requirement that the strategy sets be polyhedral) are imposed. I demonstrate that the graph of the Nash equilibrium correspondence on this domain is homeomorphic to the space of games. This result generalizes a well-known structure theorem in [Kohlberg, E., Mertens, J.-F., 1986. On the strategic stability of equilibria. Econometrica 54, 1003–1037]. It is supplemented by an extension analogous to the unknottedness theorems in [Demichelis S., Germano, F., 2000. Some consequences of the unknottedness of the Walras correspondence. J. Math. Econ. 34, 537–545; Demichelis S., Germano, F., 2002. On (un)knots and dynamics in games. Games Econ. Behav. 41, 46–60]: the graph of the Nash equilibrium correspondence is ambient isotopic to a trivial copy of the space of games.     

CORRELATED EQUILIBRIA,GOOD AND BAD: AN EXPERIMENTAL STUDY*

We report results from an experiment that explores the empirical validity of correlated equilibrium, an important generalization of Nash equilibrium. Specifically, we examine the conditions under which subjects playing the game of Chicken will condition their behavior on private third‐party recommendations drawn from publicly announced distributions. We find that when recommendations are given, behavior differs from both a mixed‐strategy Nash equilibrium and behavior without recommendations. In particular, subjects typically follow recommendations if and only if (1) those recommendations derive from a correlated equilibrium and (2) that correlated equilibrium is payoff‐enhancing relative to the available Nash equilibria.     

Evolutionary stability and lexicographic preferences

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. Econ. Theory 57, 278–305) are limit Nash equilibria. Modified evolutionary stability differs from “lexicographic evolutionarily stability” (defined by extending the common characterization of evolutionary stability to lexicographic preferences) in the order in which limits in the payoff space and the space of invasion barriers are taken.     

Undecidability of the existence of pure Nash equilibria

Summary. The purpose of this paper is to show that for any positive integer n, there exists no algorithm which decides for each non-cooperative n-person game in strategic form with partially computable payoff functions whether it has a pure Nash equilibrium or not.Received: 20 March 2002, Revised: 23 April 2003, JEL Classification Numbers: C72.The author thanks the Referee and the Associate Editor for offering critical comments on this paper, which is dedicated to his brother Konstantinos Efstathiou Sofronidis.     

Institutions,assortative matching and cultural evolution

This paper studies the role of institution in a Darwinian evolutionary process of cultural selection. The primary function of an institution is to determine how citizens in a society are matched pairwisely to interact. We examine three different types of institutions: utilitarian, egalitarian, and Nash. Two cultural types stand out in the long run through the evolutionary process. The opportunistic cultural type maximizes individual payoff against another opportunistic cultural type, while the civic-minded cultural type maximizes the total payoff of a pair. We show that the structure of the underlying interactions among citizens plays a critical role. On the one hand, the evolutionary stability of the civic-minded cultural type requires supermodularity of the citizens’ payoff function under the utilitarian institution and log-supermodularity in addition under the Nash institution. On the other hand, the evolutionary stability of the opportunistic cultural type requires submodularity of the citizens’ payoff function under the utilitarian institution and log-submodularity under the Nash institution. Neither type’s evolutionary stability is guaranteed under the egalitarian institution.     

Robustness to strategic uncertainty

We introduce a criterion for robustness to strategic uncertainty in games with continuum strategy sets. We model a player's uncertainty about another player's strategy as an atomless probability distribution over that player's strategy set. We call a strategy profile robust to strategic uncertainty if it is the limit, as uncertainty vanishes, of some sequence of strategy profiles in which every player's strategy is optimal under his or her uncertainty about the others. When payoff functions are continuous we show that our criterion is a refinement of Nash equilibrium and we also give sufficient conditions for existence of a robust strategy profile. In addition, we apply the criterion to Bertrand games with convex costs, a class of games with discontinuous payoff functions and a continuum of Nash equilibria. We show that it then selects a unique Nash equilibrium, in agreement with some recent experimental findings.     

On the Coalition-Proofness of the Pareto Frontier of the Set of Nash Equilibria

This article shows that the Pareto efficient frontier of the Nash equilibrium set of games with strategic substitutes is coalition-proof under the following conditions: (1) the game has three players, or, alternatively, a player's payoff depends on her own strategy and on the sum (but not on the composition) of other players' strategies; (2) an increase in a player's strategy either raises all other players' payoffs monotonically or reduces them monotonically; and (3) each player's payoff is strictly concave in her own strategy. Under these conditions, the Pareto dominance refinement is equivalent to the coalition-proof Nash equilibrium refinement.Journal of Economic LiteratureClassification Number: C72.     

Finding a Nash equilibrium in spatial games is an NP-complete problem

Summary. We consider the class of (finite) spatial games. We show that the problem of determining whether there exists a Nash equilibrium in which each player has a payoff of at least k is NP-complete as a function of the number of players.Received: 15 September 2002, Revised: 9 March 2003, JEL Classification Numbers: C72.Correspondence to: H. HallerWe thank a referee for helpful comments. The hospitality of the Institute of Economics, University of Copenhagen, and the Institute for Advanced Studies, Vienna, is gratefully acknowledged by the third author.     

Finding all Nash equilibria of a finite game using polynomial algebra

The set of Nash equilibria of a finite game is the set of nonnegative solutions to a system of polynomial equations. In this survey article, we describe how to construct certain special games and explain how to find all the complex roots of the corresponding polynomial systems, including all the Nash equilibria. We then explain how to find all the complex roots of the polynomial systems for arbitrary generic games, by polyhedral homotopy continuation starting from the solutions to the specially constructed games. We describe the use of Gröbner bases to solve these polynomial systems and to learn geometric information about how the solution set varies with the payoff functions. Finally, we review the use of the Gambit software package to find all Nash equilibria of a finite game.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

A game of timing and visibility

We consider the following abstraction of competing publications. There are n players in the game. Each player i chooses a point x_i in the interval [0,1], and a player's payoff is the distance from its point x_i to the next larger point, or to 1 if x_i is the largest. For this game, we give a complete characterization of the Nash equilibrium for the two-player game, and, more important, we give an efficient approximation algorithm to compute numerically the symmetric Nash equilibrium for the n-player game. The approximation is computed via a discrete version of the game. In both cases, we show that the (symmetric) equilibrium is unique. Our algorithmic approach to the n-player game is non-standard in that it does not involve solving a system of differential equations. We believe that our techniques can be useful in the analysis of other timing games.