An Evolutionary Interpretation of Mixed-Strategy Equilibria

A convincing interpretation of mixed-strategy equilibria describes them as steady states in a large population in which players use pure strategies but the population as a whole mimics a mixed strategy. I study the conditions under which an evolutionary, stochastic learning process converges to the appropriate distribution over pure strategies in the population. I find that not all mixed equilibria can be justified as the result of an evolutionary process even if the equilibrium is unique. For symmetric 2 × 2 and 3 × 3 games I give necessary and sufficient conditions for convergence, which are related to the concept of an ESS, and forn × ngames I give a sufficient condition.Journal of Economic LiteratureClassification Numbers: C73, D83.     

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.     

Nash equilibrium in games with incomplete preferences

Summary. This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed.Received: 22 September 2003, Revised: 24 June 2004, JEL Classification Numbers: D11, C72, D43.I would like to thank Jean-Pierre Benôit, Juan Dubra, Alejandrio Jofre, Debraj Ray, Kim-Sau Chung and the seminar participants at NYU and at the Universidad de Chile for their comments. I am most grateful to Efe Ok, for his comments, criticism, suggestions and questions.     

Non-Additive Beliefs and Strategic Equilibria

This paper studies n-player games where players' beliefs about their opponents' behaviour are modelled as non-additive probabilities. The concept of an “equilibrium under uncertainty” which is introduced in this paper extends the equilibrium notion of Dow and Werlang (1994, J. Econom. Theory64, 305–324) to n-player games in strategic form. Existence of such an equilibrium is demonstrated under usual conditions. For low degrees of ambiguity, equilibria under uncertainty approximate Nash equilibria. At the other extreme, with a low degree of confidence, maximin equilibria appear. Finally, robustness against a lack of confidence may be viewed as a refinement for Nash equilibria. Journal of Economic Literature Classification Numbers: C72, D81.     

A Property of Nash Equilibria in Repeated Games with Incomplete Information

We consider two-person non-zero-sum infinitely repeated games with lack of information on one side. The characterization of Nash equilibrium payoffs obtained by Hart allows for complex strategies, which are actually required by some equilibrium payoffs in some games. We show that appropriate one-shot public communication mechanisms make Nash equilibrium payoffs achievable by means of simple strategies. Furthermore, these mechanisms satisfy a notion of self-fulfillment.Journal of Economic LiteratureClassification Numbers: D82, C72.     

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.     

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.     

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.     

Ambiguous Games

This paper introduces ambiguous games, a modification of the normal form that allows the presence of vagueness in players' beliefs over the opponents' choice of strategies. An appropriate notion of equilibrium is presented, and a general existence result is proved. Journal of Economic Literature Classification Numbers: C72, D81.     

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.     

Extensive Form Games with Uncertainty Averse Players

Nash equilibrium presumes that the beliefs of a player are represented by a probability measure. Motivated by the Ellsberg Paradox and relevant experimental findings demonstrating that this representation of beliefs may be unrealistic, this paper generalizes Nash equilibrium in finite extensive form games to allow for preferences conforming to the multiple priors model developed by Gilboa and Schmeidler [Journal of Mathematical Economics, 18 (1989), 141–153]. The implications of this generalization for strategy choices and welfare are studied. Journal of Economic Literature Classification Numbers: C72, D81.     

Unobservable Contracts as Precommitments

It is well known that signing publicly observable contracts with third parties is a means of credibly committing to certain actions and hence may yield strategic advantages. Previous work on the commitment value of unobservable contracts has been limited to normal form games and extensive form games in which only one party has the option to sign a contract. In this paper, we extend the analysis to extensive form games in which both players can sign contracts, and characterize the set of sequential equilibria. We show that any Nash equilibrium outcome of the original game in which both players receive more than their individually rational payoffs can be supported as a sequential equilibrium outcome. Therefore, delegation acts not only as a commitment device to gain advantage over the opponent, but also as a cooperative device to attain Pareto improvements over the subgame perfect equilibrium outcome. I would like to thank Atila Abdulkadiroglu, Jean-Pierre Benoit, Alberto Bisin, Boyan Jovanovic, Ehud Kalai, Giuseppe Lopomo, George Mailath, Efe Ok, Ariel Rubinstein, Andy Schotter, seminar participants at various universities and conferences, and anonymous referees for helpful comments and suggestions. Support from the Alfred P. Sloan Foundation and Program for Economic Research at Columbia University is also gratefully acknowledged.     

Perfect communication equilibria in repeated games with imperfect monitoring

This paper introduces an equilibrium concept called perfect communication equilibrium for repeated games with imperfect private monitoring. This concept is a refinement of Myerson's [Myerson, R.B., 1982. Optimal coordination mechanisms in generalized principal agent problems, J. Math. Econ. 10, 67–81] communication equilibrium. A communication equilibrium is perfect if it induces a communication equilibrium of the continuation game, after every history of messages of the mediator. We provide a characterization of the set of corresponding equilibrium payoffs and derive a Folk Theorem for discounted repeated games with imperfect private monitoring.     

On the Irrelevance of Risk Attitudes in Repeated Two-Outcome Games

We study equilibrium and maximin play in supergames consisting of the sequential play of a finite collection of stage games, where each stage game has two outcomes for each player. We show that for two-player supergames in which each stage game is strictly competitive, in any Nash equilibrium of the supergame, play at each stage is a Nash equilibrium of the stage game provided preferences over certain supergame outcomes satisfy a natural monotonicity condition. In particular, equilibrium play does not depend on risk attitudes. We establish an invariance result for games with more than two players when the solution concept is subgame perfection. Journal of Economic Literature Classification Numbers: C72, C9.     

Hierarchical thinking and learning in rank order contests

We analyze a class of coordination games in which the Kth player to submit an entry wins a contest. These games have an infinite number of symmetric equilibria and the set of equilibria does not change with K. We run experiments with 15 participants and with K=3, 7, and 11. Our experiments show that the value of K affects initial submissions and convergence to equilibrium. When K is small relative to the number of participants, our experiments show that repeated play converges to or near zero. When K is large, an equilibrium is often not reached as a result of repeated play. We seek explanations to these patterns in hierarchical thinking and direction learning.      

Imitation and selective matching in reputational games

This paper investigates imitation and selective matching in reputational games with an outside option. We identify two classes of such games, ultimatum and trust games. By selective matching we mean that short-run players have the possibility of selecting the long-run player they play against. We find that selective matching (unlike random matching) favors the equilibrium associated to reputation in the ultimatum game, but not in the trust game.     

Infinite horizon common interest games with perfect information

We consider infinite horizon common interest games with perfect information. A game is a K-coordination game if each player can decrease other players' payoffs by at most K times his own cost of punishment. The number K represents the degree of commonality of payoffs among the players. The smaller K is, the more interest the players share. A K-coordination game tapers off if the greatest payoff variation conditional on the first t periods of an efficient history converges to 0 at a rate faster than K^−t as t→∞. We show that every subgame perfect equilibrium outcome is efficient in any tapering-off game with perfect information. Applications include asynchronously repeated games, repeated games of extensive form games, asymptotically finite horizon games, and asymptotically pure coordination games.     

Cooperation in an Overlapping Generations Experiment

Recent theoretical work shows that folk theorems can be developed for infinite overlapping generations games. Cooperation in such games can be sustained as a Nash equilibrium. But, of course, there are other equilibria. This paper investigates experimentally whether cooperation actually occurs in a simple overlapping generations game. Subjects both play the game and formulate strategies. Our main finding is that subjects fail to exploit the intertemporal structure of the game. Even when we provided subjects with a recommendation to play the grim trigger strategy, most of the subjects still employed safe history-independent strategies. Journal of Economic Literature Classification Numbers: C72, C92, D90.     

How to Select a Dual Nash Equilibrium

The paper analyzes situations, generalizing the duopoly problem, where two identical players are allowed with two control variables each, all of them linked through two non-strategic private constraints. Four dual equilibria are then obtained when each agent selects one leading variable to optimize and adjusts the other, and these equilibria are compared in a meta-game. For a simplified class of continuous games with linear constraints, it is shown that one symmetric dual equilibrium dominates the others and is the only perfect equilibrium of the metagame. The latter result holds locally for all quasi-concave utility functions and globally for all homogeneous ones, always keeping linear constraints. However, it is no longer valid in discrete games where the implicit constraints are not linear. Journal of Economic Literature Classification Numbers: C72, D43.     

Credible Equilibria in Games with Utilities Changing during the Play

Whenever one deals with an interactive decision situation of long duration, one has to take into account that priorities of the participants may change during the conflict. In this paper we propose an extensive-form game model to handle such situations and suggest and study a solution concept, called credible equilibrium, which generalizes the concept of Nash equilibrium. We also discuss possible variants to this concept and applications of the model to other types of games. American Mathematical Society Classification Numbers: 90A06, 90A07, 90A43, 90A56, 90D06, 90D10, 90D35, 90D40, 90D80. Journal of Economic Literature Classification Numbers: C70, C72, D10, D11, D80, D83.