Existence of perfect equilibria: a direct proof

We provide a direct proof of the existence of perfect equilibria in finite normal form games and extensive games with perfect recall. It is done by constructing a correspondence whose fixed points are precisely the perfect equilibria of a given finite game. Existence of a fixed point is secured by a generalization of Kakutani theorem, which is proved in this paper. This work offers a new approach to perfect equilibria, which would hopefully facilitate further study on this topic. We also hope our direct proof would be the first step toward building an algorithm to find the set of all perfect equilibria of a strategic game.     

Random belief equilibrium in normal form games

In defining random belief equilibrium (RBE) in finite, normal form games we assume a player's beliefs about others' strategy choices are randomly drawn from a belief distribution that is dispersed around a central strategy profile, the focus. At an RBE: (1) Each chooses a best response relative to her beliefs. (2) Each player's expected choice coincides with the focus of the other players' belief distributions. RBE provides a statistical framework for estimation which we apply to data from three experimental games. We also characterize the limit-RBE as players' beliefs converge to certainty. When atoms in the belief distributions vanish in the limit, not all limit-RBE (called robust equilibria) are trembling hand perfect Nash equilibria and not all perfect equilibria are robust.     

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.     

A theory of stopping time games with applications to product innovations and asset sales

Summary In this paper, the pure strategy subgame perfect equilibria of a general class of stopping time games are studied. It is shown that there always exists a natural class of Markov Perfect Equilibria, called stopping equilibria. Such equilibria can be computed as a solution of a single agent stopping time problem, rather than of a fixed point problem. A complete characterization of stopping equilibria is presented. Conditions are given under which the outcomes of such equilibria span the set of all possible outcomes from perfect equilibria. Two economic applications of the theory, product innovations and the timing of asset sales, are discussed.Parts of this paper were presented at seminars at Chicago, Rochester and Rutgers and we acknowledge helpful comments. We are also indebted to a referee for his detailed and thoughtful comments. The usual disclaimer applies.     

Rationalizable foresight dynamics

This paper proposes and studies the rationalizable foresight dynamics. A normal form game is repeatedly played in a random matching fashion by a continuum of agents who make decisions at stochastic points in time. A rationalizable foresight path is a feasible path of action distribution along which each agent takes an action that maximizes his expected discounted payoff against another path which is in turn a rationalizable foresight path. We consider a set-valued stability concept under this dynamics and compare it with the corresponding concept under the perfect foresight dynamics.     

Asymptotic expected number of Nash equilibria of two-player normal form games

The formula given by McLennan [The mean number of real roots of a multihomogeneous system of polynomial equations, Amer. J. Math. 124 (2002) 49–73] is applied to the mean number of Nash equilibria of random two-player normal form games in which the two players have M and N pure strategies respectively. Holding M fixed while N→∞, the expected number of Nash equilibria is approximately . Letting M=N→∞, the expected number of Nash equilibria is , where is a constant, and almost all equilibria have each player assigning positive probability to approximately 31.5915 percent of her pure strategies.     

Perfect Information and Potential Games

Games with perfect information giving rise to potential normal forms are described. For agent normal forms, a potential is defined such that a strategy profile is a maximizer for the potential if and only if it is a subgame perfect equilibrium. In the normal form of any game with perfect information, every better reply path where the players do not change their choices at irrelevant nodes leads to an equilibrium. Journal of Economic Literature Classification Number: C72.     

Selective Acceptance and Inefficiency in a Two-Issue Complete Information Bargaining Game

This paper explores the effects of a “selective acceptance” rule on the outcome of two-issue negotiations. The alternating-offer game introduced here allows for the possibility that settlement may be reached on one issue while negotiation continues about the other. This model captures features of laws that are generally believed to increase efficiency. The analysis shows that if one issue is indivisible, there are inefficient subgame perfect equilibria with no Pareto-improving alternative equilibria. With opposing valuations, rapid communication guarantees inefficiency. These are unique examples of this strong form of inefficiency in an alternating-offer bargaining game with complete (and perfect) information. Journal of Economic Literature Classification Numbers: C72, J30.     

The local best response criterion: An epistemic approach to equilibrium refinement

The standard refinement criteria for extensive form games, including subgame perfect, perfect, perfect Bayesian, sequential, and proper, reject important classes of reasonable Nash equilibria and accept many unreasonable Nash equilibria. This paper develops a new refinement criterion, based on epistemic game theory, that captures the concept of a Nash equilibrium that is plausible when players are rational. I call this the local best response (LBR) criterion. This criterion is conceptually simpler than the standard refinement criteria because it does not depend on out-of-equilibrium, counterfactual, or passage to the limit arguments. The LBR is also informationally richer because it clarifies the epistemic conditions that render a Nash equilibrium reasonable. The LBR criterion appears to render the traditional refinement criteria superfluous.     

A simple search model of money with heterogeneous agents and partial acceptability

Summary. Simple search models have equilibria where some agents accept money and others do not. We argue such equilibria should not be taken seriously. This is unfortunate if one wants a model with partial acceptability. We introduce heterogeneous agents and show partial acceptability arises naturally and robustly. There can be multiple equilibria with different degrees of acceptability. Given the type of heterogeneity we allow, the model is simple: equilibria reduce to fixed points in [0,1]. We show that with other forms of heterogeneity equilibria are fixed points in set space, and there is no method to reduce this to a problem in R¹.Received: 4 September 2002, Revised: 23 September 2002JEL Classification Numbers: C78, E40.A. Shevchenko, R. Wright: We thank seminar participants at the Federal Reserve Bank of Cleveland, Indiana University, Purdue University, University of Toronto, the 2002 Midwest Macroeconomics Conference at Vanderbilt University, and the 2001 Conference on Economic Dynamics at the University of Essex. The National Science Foundation and the Federal Reserve Bank of Cleveland provided financial support. Braz Ministerio de Camargo and Gabriel Camera provided some helpful suggestions. Correspondence to: R. Wright     

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.     

Nash equilibrium and generalized integration for infinite normal form games

Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite choice sets.Finitistic equilibria are the limits of approximate equilibria taken along generalized sequences of finite subsets of the strategy spaces. Points must be added to the strategy spaces to represent these limits. There are direct, nonstandard analysis, and indirect, compactification and selection, representations of these points. The compactification and selection approach was introduced [Simon, L.K., Zame, W.R., 1990. Discontinuous games and endogenous sharing rules. Econometrica 58, 861–872]. It allows for profitable deviations and introduces spurious correlation between players' choices. Finitistic equilibria are selection equilibria without these drawbacks. Selection equilibria have drawbacks, but contain a set-valued theory of integration for non-measurable functions tightly linked to, and illuminated by, the integration of correspondences.     

Economic Dynasties with Intermissions

We consider a model of successive generations with a fixed proportion of selfish and altruistic members in each individual's offspring. In contrast with the others, selfish members bequeath nothing to their own children. We assume that parents cannot recognize their heirs' types and that negative bequests are forbidden. We study Markov perfect equilibria of this multistage game of incomplete information and their implications for wealth distribution.Journal of Economic LiteratureClassification Numbers: D31, D64, D91, H63.     

Chores

We analyze situations where the provision of each of c public goods must be voluntarily assumed by exactly one of n private agents in the absence of transfer schemes or binding contracts. We model this problem as a complete information, potentially infinite horizon game where n agents simultaneously wage c wars of attrition. Providing a public good commits an agent not to take on the provision of another public good for a fixed period. We explore the strategic trade-offs that this commitment ability and the multiplicity of tasks provide. Subgame perfect equilibria (SPEs) are characterized completely for games with two agents and two public goods. For games with two identical agents and c > 1 identical public goods, we establish that an equilibrium that yields a surplus-maximizing outcome always exists and we provide sufficient conditions under which it is the unique equilibrium outcome. We show that under mild conditions, the surplus-maximizing SPE is the unique symmetric SPE. Journal of Economic Literature Classification Number: H41, C72, D13.     

Existence of Nash equilibria in finite extensive form games with imperfect recall: A counterexample

This paper provides an example showing that for finite extensive form games without perfect recall existence of Nash equilibria in behaviour strategies is not guaranteed in general.     

On ‘Informationally Robust Equilibria’ for Bimatrix Games

Informationally robust equilibria (IRE) are introduced in Robson (Games Econ Behav 7: 233–245, 1994) as a refinement of Nash equilibria for strategic games. Such equilibria are limits of a sequence of (subgame perfect) Nash equilibria in perturbed games where with small probability information about the strategic behavior is revealed to other players (information leakage). Focusing on bimatrix games, we consider a type of informationally robust equilibria and derive a number of properties they form a non-empty and closed subset of the Nash equilibria. Moreover, IRE is a strict concept in the sense that the IRE are independent of the exact sequence of probabilities with which information is leaked. The set of IRE, like the set of Nash equilibria, is the finite union of polytopes. In potential games, there is an IRE in pure strategies. In zero-sum games, the set of IRE has a product structure and its elements can be computed efficiently by using linear programming. We also discuss extensions to games with infinite strategy spaces and more than two players. The authors would like to thank Marieke Quant for her helpful comments.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

Information structures and decentralizability of equilibria

Summary Decentralizability with respect to an equilibrium concept means that those equilibria for an extensive game and its agent normal form game coincide for any given payoffs. We consider decentralizability of Nash equilibrium, subgame perfect equilibrium, and perfect equilibrium. For each equilibrium concept we give a necessary and sufficient condition on the information structure of an extensive game for decentralizability to hold. When it holds it does not matter if agents with the same objectives decide independently or have someone coordinate their actions.The author thanks Satish Chand, Mamoru Kaneko, Akira Okada and participants at seminars at the Australian National University, Kyoto University, University of Tsukuba, and The First Decentralization Conference in Japan held at Keio University for valuable suggestions and comments.     

Monotone Games with Positive Spillovers

A monotone game comprises the infinitely repeated play of an n-person stage game, subject to the constraint that players' actions be monotonically nondecreasing over time. These games represent a variety of strategic situations in which players are able to make (partial) commitments. If the stage games have positive spillovers and satisfy certain other conditions, then the limit points of the subgame perfect equilibria are precisely the approachable action profiles. This characterization is applied to voluntary contribution games, market games, and coordination games. Journal of Economic Literature Classification Number: C7.