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.     

Learning in games with strategic complementarities revisited

Fictitious play is a classical learning process for games, and games with strategic complementarities are an important class including many economic applications. Knowledge about convergence properties of fictitious play in this class of games is scarce, however. Beyond games with a unique equilibrium, global convergence has only been claimed for games with diminishing returns [V. Krishna, Learning in games with strategic complementarities, HBS Working Paper 92-073, Harvard University, 1992]. This result remained unpublished, and it relies on a specific tie-breaking rule. Here we prove an extension of it by showing that the ordinal version of strategic complementarities suffices. The proof does not rely on tie-breaking rules and provides some intuition for the result.     

A unified approach to comparative statics puzzles in experiments

The paper shows that several game-theoretic solution concepts provide similar comparative statics predictions over a wide class of games. I start from the observation that, in many experiments, behavior is affected by parameter shifts that leave the Nash equilibrium unchanged. I explain the direction of change with a heuristic structural approach, using properties such as strategic complementarities and increasing differences. I show that the approach is consistent with general comparative statics results for (i) the Nash equilibrium of a game with perturbed payoff functions, (ii) the quantal response equilibrium, (iii) level-k reasoning. I also relate the structural approach to equilibrium selection concepts.     

Waiting times and equilibrium selection

Summary. This paper shows how graphs can be used to calculate waiting times in models of equilibrium selection. It also shows how reducing the state space can simplify the calculations of both waiting times and selected equilibria. The results are applied to potential games and games with strategic complementarities.Received: 31 December 2002, Revised: 25 October 2003, JEL Classification Numbers: C72, C73.Alan Beggs: I am grateful to an anonymous referee for helpful comments.     

Finding all equilibria in games of strategic complements

I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with strategic complementarities. This is the first non-trivial algorithm for finding all pure-strategy Nash equilibria.     

Monotone equilibria in Bayesian games of strategic complementarities

For Bayesian games of strategic complementarities, we provide a constructive proof of the existence of a greatest and a least Bayesian Nash equilibrium, each one in strategies that are monotone in type. Our main assumptions, besides strategic complementarities, are that each player's payoff displays increasing differences in own action and the profile of types and that each player's interim beliefs are increasing in type with respect to first-order stochastic dominance (e.g., types are affiliated). The result holds for general action and type spaces (single-, multi-, or infinite-dimensional; continuous or discrete) and no prior is assumed. We also provide the following comparative statics result: the greatest and least equilibria are higher if there is a first-order stochastic dominant shift in the interim beliefs. We apply this result to strategic information revelation in games of voluntary disclosure.     

Extensive-form games and strategic complementarities

I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a nonempty, complete lattice—in particular, subgame-perfect Nash equilibria exist. For this purpose I introduce a device that allows the study of the set of subgame-perfect equilibria as the set of fixed points of a correspondence. My results are limited because extensive-form games of strategic complementarities turn out—surprisingly—to be a very restrictive class of games.     

Uncertainty, co-ordination and path dependence

Our objective is to assess whether dynamics hinder or assist co-ordination in a game with strategic complementarities. We study two dynamic aspects: different agents make decisions at different points in time; and extra information about a payoff-relevant state of nature becomes available over time. We find that the dynamic resolution of information matters most for uniqueness of equilibrium. This is demonstrated by showing that the condition for uniqueness is weaker when learning occurs. We also analyse how successfully agents co-ordinate when there is a unique equilibrium. Finally, we show that path dependence occurs: the order in which signals arrive matters, as well as the total amount of information received.     

Characterizing solutions of supermodular games; intuitive comparative statics,and unique equilibria

Summary We present a technique for locating both an upper and a lower bound on equilibrium points of supermodular games by looking only at the first derivatives of the payoff functions at points of disequilibrium. This technique is useful for characterizing equilibria of games when the closed form solution is difficult to calculate, for performing comparative statics analysis, and for determining the uniqueness of equilibria.I would like to thank David Easley, James Friedman, Ken Kasa, Rich McLean and Michael Waldman for their helpful comments.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Informal communication

The typical sender-receiver game studied in the literature assumes that receiver is uninformed. I analyze a model where receiver has private information and sender cares to be perceived as honest. If sender's honesty concerns are strong enough, the model predicts information revelation as a unique equilibrium. This uniqueness result contrasts with the multiplicity of equilibria in games with uninformed receiver. To achieve information revelation as a unique equilibrium, receiver may have to ask for information, which is extraneous for her decision. If sender's honesty concerns are not too strong, asking for extraneous information may create an incentive for lying.     

Uniqueness of equilibrium for smooth multistage concave games

Smooth, noncooperative, multistage, concave games are formulated so that a new uniqueness condition—based on the Poincaré-Hopf theorem—can be applied. The new condition is the weakest to appear in the uniqueness literature. The uniqueness subgame perfect equilibrium is obtained and examples are given.     

GLOBAL GAMES WITH STRATEGIC SUBSTITUTES

We study global games with strategic substitutes. Specifically, for a class of binary‐action, ‐player games with strategic substitutes, we prove that under payoff asymmetry, as incomplete information vanishes, the global games approach selects a unique equilibrium. We characterize this equilibrium profile ; players employ switching strategies at different cutoff signals, the order of which is directly determined by payoff asymmetry. We provide examples that illustrate our result and its connection with dominance solvability. We extend the global game literature, which has thus far been developed for games with strategic complementarities, to new applications in industrial organization, collective action problems, finance, etc .     

Cooperation in Experimental Games of Strategic Complements and Substitutes

We conduct a laboratory experiment aimed at examining whether strategic substitutability and strategic complementarity have an impact on the tendency to cooperate in finitely repeated two-player games with a Pareto-inefficient Nash equilibrium. We find that there is significantly more cooperation when actions exhibit strategic complementarities than in the case of strategic substitutes. The difference is to some extent driven by a difference in the speed with which some pairs reach stable full cooperation, but mainly by differences in choices of pairs that do not succeed in reaching full cooperation.     

Subgame-perfect equilibria of finite- and infinite-horizon games

We show that subgame-perfect equilibria of infinite-horizon games arise as limits, as the horizon grows long and epsilon small, of subgame-perfect epsilon-equilibria of games which are truncated after a finite horizon. A number of applications show that this result provides a useful technique for analyzing the existence and uniqueness of infinite-horizon equilibria. We extend our result to the sequential equilibrium concept.     

Serial dictatorship and Pareto optimality

In a deterministic allocation problem in which each agent is entitled to receive exactly one object, an allocation is Pareto optimal if and only if it is the outcome of a serial dictatorship. We extend the definition of serial dictatorship to settings in which some agents may be entitled to receive more than one object, and study the efficiency and uniqueness properties of the equilibrium allocations. We prove that subgame perfect equilibrium allocations of serial dictatorship games are not necessarily Pareto optimal; and generally not all Pareto optima can be implemented as subgame perfect equilibrium allocations of serial dictatorship games, except in the 2-agent separable preference case. Moreover, serial dictatorship games do not necessarily have unique subgame perfect equilibrium allocations, except in the 2-agent case, hence their outcomes are indeterminate and manipulable.     

Mixed equilibria in games of strategic complementarities

Summary. The literature on games of strategic complementarities (GSC) has focused on pure strategies. I introduce mixed strategies and show that, when strategy spaces are one-dimensional, the complementarities framework extends to mixed strategies ordered by first-order stochastic dominance. In particular, the mixed extension of a GSC is a GSC, the full set of equilibria is a complete lattice and the extremal equilibria (smallest and largest) are in pure strategies. The framework does not extend when strategy spaces are multi-dimensional. I also update learning results for GSC using stochastic fictitious play. Received: October 16, 2000; revised version: March 7, 2002 RID="*" ID="*" I am very grateful to Robert Anderson, David Blackwell, Aaron Edlin, Peter De Marzo, Ted O'Donoghue, Matthew Rabin, Ilya Segal, Chris Shannon, Clara Wang and Federico Weinschelbaum for comments and advise.     

The convergence of equilibrium strategies of approximating signaling games

Summary For a class of infinite signaling games, the perfect Bayesian equilibrium strategies of finite approximating games converge to equilibrium strategies of the infinite game. This proves the existence of perfect Bayesian equilibrium for that class of games. It is well known that in general, equilibria may not exist in infinite signaling games.I am very grateful to Karl Iorio with whom I derived most of the results in this paper. I am solely responsible for any remaining errors. I am also grateful to Robert Anderson, Debra Aron, Eddie Dekel, Raymond Deneckere, Michael Kirscheneiter, Steven Matthews, Roger Myerson, Daniel Vincent and Robert Weber for comments on previous drafts of this paper.     

Strong Equilibrium in Congestion Games

[6]introduced the class of congestion games and proved that they always possess a Nash equilibrium in pure strategies. Here we obtain conditions for the existence of a strong equilibrium in this class of games, as well as for the equivalence of Nash and strong equilibria. We also give conditions for uniqueness and for Pareto optimality of the Nash equilibrium. Except for a natural monotonicity assumption on the utilities, the conditions are expressed only in terms of the underlying congestion game form. It turns out that avoiding a certain type of bad configuration in the strategy spaces is essential to positive results.Journal of Economic LiteratureClassification Numbers: C71, C72, D62.     

Regularity of pure strategy equilibrium points in a class of bargaining games

Summary. We develop an index theory for the Stationary Subgame Perfect (SSP) equilibrium set in a class of n-player sequential bargaining games with probabilistic recognition rules. For games with oligarchic voting rules (a class that includes unanimity rule), we establish conditions on individual utilities that ensure that for almost all discount factors, the number of SSP equilibria is odd and the equilibrium correspondence lower-hemicontinuous. For games with general, monotonic voting rules, we show generic (in discount factors) determinacy of SSP equilibria under the restriction that the agreement space is of dimension one. For non-oligarchic voting rules and agreement spaces of higher finite dimension, we establish generic determinacy for the subset of SSP equilibria in pure strategies. The analysis also extends to the case of fixed delay costs. Lastly, we provide a sufficient condition for uniqueness of SSP equilibrium in oligarchic games.Received: 13 May 2004, Revised: 1 March 2005, JEL Classification Numbers: C62, C72, C78.I thank John Duggan and participants of the 2003 annual meeting of the American Political Science Association, Philadelphia, PA, the Political Economy Seminar at Northwestern University, and the Economic Theory seminar at the University of Rochester for helpful comments.