On the generic strategic stability of Nash equilibria if voting is costly

Summary. We prove that for generic plurality games with positive cost of voting, the number of Nash equilibria is finite. Furthermore all the equilibria are regular, hence stable sets as singletons.JEL Classification Numbers: C72, D72.We would like to thank Luisa Bassotto, Marco Celentani, Mamoru Kaneko, and participants at the 6 International Conference on Current Trends in Economics for helpful comments. We also thank an anonymous referee of this journal for precious advices that have substantially improved this paper. This paper was partially written while Francesco was visiting Tor Vergata University, which he thanks for hospitality and financial support. The usual disclaimer applies.     

Generic determinacy of Nash equilibrium in network-formation games

This paper proves the generic determinacy of Nash equilibrium in network-formation games: for a generic assignment of utilities to networks, the set of probability distributions on networks induced by Nash equilibria is finite.     

On the Generic Finiteness of Equilibrium Outcomes in Plurality Games

In this paper we prove that for generic (noncooperative) voting games under plurality rule the set of equilibria that induce a mixed distribution over the outcomes (i.e., with two or more candidates elected with positive probability) is finite and, furthermore, each of these equilibria is regular. From that we deduce the finiteness of the set of equilibrium distributions over outcomes. Furthermore we offer an example (S. Govindan and A. McLennan, 1997, “On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms,” mimeo) that shows the impossibility of extending such results to a general framework, even just to voting games. Journal of Economic Literature Classification Numbers: C72, D72.     

Markovian equilibrium in a class of stochastic games: existence theorems for discounted and undiscounted models

Summary We study a strategic version of the neoclassical growth model under possible production uncertainty. For a general specification of the problem, we establish (i) the existence of stationary Markov equilibria in pure strategies for the discounted game, and (ii) the convergence, under a boundedness condition, of discounted equilibrium strategies to a pure strategy stationary Markovian equilibrium of the undiscounted game as the discount factor tends to unity. The same techniques can be used to prove that such convergence also obtains in all finitestate, finite-action stochastic games satisfying a certain full communicability condition. These results are of special interest since there are well known examples in the literature in which the limit of discounted equilibria fails to be an equilibrium of the undiscounted game.We are grateful to Marcus Berliant, M. Ali Khan, Mukul Majumdar, and an anonymous referee for helpful suggestions, and to Bonnie Huck for technical assistance. The first author acknowledges research support from the Columbia University Council for the Social Sciences.     

Egalitarianism and Efficiency in Repeated Symmetric Games

We analyze the symmetric equilibria of repeated symmetric games where there is a conflict of interests over equilibria—the battle-of-the-sexes or the hawk–dove game are key examples. If one restricts attention to symmetric equilibria, efficient equilibria must be egalitarian. For finitely repeated games, and generic discount factors, there is a unique outcome path which ensures efficiency within the class of symmetric equilibria. This is also true for the infinitely repeated games if the players are sufficiently impatient. Journal of Economic Literature Classification Numbers: C72, C73.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

Equilibrium Selection inn-Person Coordination Games

This paper investigates several approaches to equilibrium selection and the relationships between them. The class of games we study aren-person generalized coordination games with multiple Pareto rankable strict Nash equilibria. The main result is that all selection criteria select the same outcome (namely the risk dominant equilibrium) in two-person games, and that most equivalences break for games with more than two players. All criteria select the Pareto efficient equilibrium in voting games, of which pure coordination games are special cases.Journal of Economic LiteratureClassification Numbers: C70, C72, D82.     

Uniqueness of Stationary Equilibrium Payoffs in the Baron-Ferejohn Model

We consider a multilateral sequential bargaining model in which the players may differ in their probability of being selected as the proposer and the rate at which they discount future payoffs. For games in which agreement requires less than unanimous consent, we characterize the set of stationary subgame perfect equilibrium payoffs. With this characterization, we establish the uniqueness of the equilibrium payoffs. For the case where the players have the same discount factor, we show that the payoff to a player is nondecreasing in his probability of being selected as the proposer. For the case where the players have the same probability of being selected as the proposer, we show that the payoff to a player is nondecreasing in his discount factor. Journal of Economic Literature Classification numbers: C72, C78, D70.     

Comparison of Scoring Rules in Poisson Voting Games

Scoring rules are compared by their equilibria in simple voting games with Poisson population uncertainty, using new techniques for computing pivot probabilities. Best-rewarding rules like plurality voting can generate discriminatory equilibria where the voters disregard some candidate as not a serious contender, although he may be universally liked, or may be symmetric to other candidates as in the Condorcet cycle. Such discriminatory equilibria are eliminated by worst-punishing rules like negative voting, but then even a universally disliked candidate may have to be taken seriously. In simple bipolar elections, equilibria are always majoritarian and efficient under approval voting, but not other scoring rules. Journal of Economic Literature Classification: D72.     

The evolution of conventions under incomplete information

Summary. We formulate an evolutionary learning process with trembles for static games of incomplete information. For many games, if the amount of trembling is small, play will be in accordance with the games (strict) Bayesian equilibria most of the time. This supports the notion of Bayesian equilibrium. Often the process will select a specific equilibrium. We study an extension to incomplete information of the prototype conflict known as Chicken and find that the equilibrium selection by evolutionary learning may well be in favor of inefficient Bayesian equilibria where some types of players fail to coordinate.Received: 17 March 2003, Revised: 3 December 2003, JEL Classification Numbers: C72.     

The structure of the Nash equilibrium sets of standard 2-player games

Summary. In this paper I study a class of two-player games, in which both players action sets are [0,1] and their payoff functions are continuous in joint actions and quasi-concave in own actions. I show that a no-improper-crossing condition is both necessary and sufficient for a finite subset A of to be the set of Nash equilibria of such a game.Received: 21 November 2002, Revised: 9 September 2004, JEL Classification Numbers: C65, C72.I am grateful to an editor of the journal and an anonymous referee for their very helpful comments. I also would like to thank the seminar participants at City University of Hong Kong, Georgia State University, Northwestern University, and Rice University.     

Stationary equilibria in stochastic games: structure, selection, and computation

This paper introduces an algorithm to compute stationary equilibria in stochastic games that is guaranteed to converge for almost all such games. Since in general the number of stationary equilibria is overwhelming, we pay attention to the issue of equilibrium selection. We do this by extending the linear tracing procedure to the class of stochastic games, called the stochastic tracing procedure. As a by-product of our results, we extend a recent result on the generic finiteness of stationary equilibria in stochastic games to oddness of equilibria.     

Information transmission in coalitional voting games

A core allocation of a complete information economy can be characterized as one that would not be unanimously rejected in favor of another feasible alternative by any coalition. We use this test of coalitional voting in an incomplete information environment to formalize a notion of resilience. Since information transmission is implicit in the Bayesian equilibria of such voting games, this approach makes it possible to derive core concepts in which the transmission of information among members of a coalition is endogenous. Our results lend support to the credible core of Dutta and Vohra [Incomplete information, credibility and the core, Math. Soc. Sci. 50 (2005) 148-165] and the core proposed by Myerson [Virtual utility and the core for games with incomplete information, Mimeo, University of Chicago, 2005] as two that can be justified in terms of coalitional voting.     

Majority Rule in a Stochastic Model of Bargaining

In this paper we consider multilateral stochastic bargaining models with general agreement rules. For n-player games where in each period a player is randomly selected to allocate a stochastic level of surplus and q?n players have to agree on a proposal to induce its acceptance, we characterize the set of stationary subgame perfect equilibrium payoffs and establish their existence. We show that for agreement rules other than the unanimity rule, the equilibrium payoffs need not be unique. Furthermore, even when the equilibrium is unique, it need not be efficient. Journal of Economic Literature Classification Numbers: C73, C78, D70.     

Voting with abstention

Most voting models in the literature neglect abstention, but is such a simplification justified? I investigate this question in a model with outside pressure on voters. For sequential voting (e.g., roll call votes), with and without an abstention option, there is a unique subgame perfect equilibrium, which implies that true majorities always succeed. Abstention can be an equilibrium strategy for some voters, in particular under complex decision rules (e.g., weighted voting, double majorities). Simultaneous voting often has a unique pure strategy equilibrium but also a plethora of mixed and pure/mixed strategy equilibria. Therefore, only with equilibrium selection, can we evaluate the consequences of neglecting abstention. For equal weight voting, equilibria selected by the procedure of Harsanyi and Selten change completely with an abstention option, even if abstention itself is not or rarely used. With small enough outside pressure, however, the selected equilibrium honors true majorities in both cases.     

Simple Markovian equilibria in dynamic spatial legislative bargaining

The paper proves, by construction, the existence of Markovian equilibria in a dynamic spatial legislative bargaining model. Players bargain over policies in an infinite horizon. In each period, a sequential protocol of proposal-making and voting, with random proposer recognitions and a simple majority, produces a policy that becomes the next period's status-quo; the status-quo is endogenous. The construction relies on simple strategies determined by strategic bliss points computed by the algorithm we provide. A strategic bliss point, the dynamic utility ideal, is a moderate policy relative to a bliss point, the static utility ideal. Moderation is strategic and germane to the dynamic environment; players moderate in order to constrain the future proposals of opponents. Moderation is a strategic substitute; when a player's opponents do moderate, she does not, and when they do not moderate, she does. We provide conditions under which the simple strategies induced by the strategic bliss points computed by the algorithm deliver a Stationary Markov Perfect equilibrium, and we prove its existence in generic games with impatient players and in symmetric games. Because the algorithm constructs all equilibria in simple strategies, we provide their general characterization, and we show their generic uniqueness.     

A characterization of strategic complementarities

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with multiple equilibria have complementarities. As applications of my results, I show that: (1) generic 2×2 games either have no pure-strategy equilibria, or have complementarities; (2) generic two-player finite ordinal potential games have complementarities.     

Further results on essential Nash equilibria in normal-form games

A Nash equilibrium \(x\) of a normal-form game \(G\) is essential if any perturbation of \(G\) has an equilibrium close to \(x\). Using payoff perturbations, we identify a new collection of games containing a dense, residual subset of games whose Nash equilibria are all essential. This collection covers economic examples that cannot be handled by extant results and subsumes the sets of games considered in the literature.     

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.     

Bayesian games with unawareness and unawareness perfection

Applying unawareness belief structures introduced in Heifetz et al. (Games Econ Behav 77:100–121, 2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower awareness levels. We apply Bayesian games with unawareness to investigate the robustness of equilibria to uncertainty about opponents’ awareness of actions. We show that a Nash equilibrium of a strategic game is robust to unawareness of actions if and only if it is not weakly dominated. Finally, we discuss the relationship between standard Bayesian games and Bayesian games with unawareness.