Binary Games with State Dependent Stochastic Choice

This paper studies a stochastic equilibrium selection model for binary coordination games. Players switch strategies stochastically so that the mistake probabilities are fully dependent on the population states. A probabilistic behavior is said to be aspiration (imitation, resp.) oriented if strategy switches are mainly driven by the aspiration (imitation, resp.) effect. In general, a strategy switch by one player generates externalities on others. Strategies in a coordination game can be classified according to the relative magnitude of their externality effects. It is shown that the selection outcome for a linear coordination game is determined in a specific way by the balance of the risk dominance, the aspiration/imitation, and the externality effects. It is also shown that an aspiration (imitation, resp.) oriented behavior tends to select payoff dominant (maxmin, resp.) equilibrium and that risk dominant equilibrium is always selected if and only if the aspiration and the imitation effects exactly cancel each other out, which in turn makes the selection process insensitive to externality effects. Journal of Economic Literature Classification Number: C72.     

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.     

Behavioral spillovers in coordination games

Motivated by problems of coordination failure observed in weak-link games, we experimentally investigate behavioral spillovers for minimum- and median-effort coordination games. Subjects play these coordination games simultaneously and sequentially. The results show that successful coordination on the Pareto optimal equilibrium in the median game influences behavior in the minimum game when the games are played sequentially. Moreover, this positive, Pareto-improving spillover is present even when group composition changes across games, although the effect is not as strong. We also find that the precedent for uncooperative behavior in the minimum game does not influence play in the median game. These findings suggest guidelines for increasing cooperative behavior within organizations.     

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.     

Timing and Virtual Observability in Ultimatum Bargaining and “Weak Link” Coordination Games

Previous studies have shown that simply knowing one player moves first can affect behavior in games, even when the first-mover's moves are known to be unobservable. This observation violates the game-theoretic principle that timing of unobserved moves is irrelevant, but is consistent with virtual observability, a theory of how timing can matter without the ability to observe actions. However, this previous research only shows that timing matters in games where knowledge that one player moved first can help select that player's preferred equilibrium, presenting an alternative explanation to virtual observability. We extend this work by varying timing of unobservable moves in ultimatum bargaining games and “weak link” coordination games. In the latter, the equilibrium selection explanation does not predict any change in behavior due to timing differences. We find that timing without observability affects behavior in both games, but not substantially.     

Reputation and Perfection in Repeated Common Interest Games

We consider a wide class of repeated common interest games perturbed with one-sided incomplete information: one player (the informed player) might be a commitment type playing the Pareto dominant action. As discounting, which is assumed to be symmetric, and the prior probability of the commitment type go to zero, it is shown that the informed player can be held close to her minmax payoff even when perfection is imposed on the equilibrium.Journal of Economic LiteratureClassification Numbers: C73, D83.     

An Example of Dynamic (In)Consistency in Symmetric Extensive Form Evolutionary Games

An example is developed to show that equilibrium selection via dynamic stability, when applied to the normal form of extensive form games, is inconsistent with the subgame structure. Alternative dynamic approaches are proposed and discussed to circumvent this inconsistency. Journal of Economic Literature Classification Numbers: C70, C72.     

Abreu–Matsushima Mechanisms: Experimental Evidence

Abreu–Matsushima mechanisms can be applied to a broad class of games to induce any desired outcome as the unique rationalizable outcome. We conduct experiments investigating the performance of such mechanisms in two simple coordination games. In these games one pure-strategy equilibrium is “focal”; we assess the efficacy of Abreu–Matsushima mechanisms for implementing the other pure-strategy equilibrium outcome. Abreu–Matsushima mechanisms induce some choices consistent with the desired outcome, but more choices reflect the focal outcome. Moreover, “strengthening” the mechanism has a perverse effect when the desired outcome is a Pareto-dominated risk-dominated equilibrium.Journal of Economic LiteratureClassification Number: C7.     

Stochastic evolution with slow learning

Summary. This paper studies the extent to which diffusion approximations provide a reliable guide to equilibrium selection results in finite games. It is shown that they do for a class of finite games with weak learning provided that limits are taken in a certain order. The paper also shows that making mutation rates small does not in general select a unique equilibrium but making selection strong does. Received: January 19, 2000; revised version: September 25, 2000     

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.     

The Statistical Mechanics of Best-Response Strategy Revision

This paper compares local and global strategic interaction when players update using the (myopic) best-response rule. I show that randomizing the order in which players update their strategic choice suffices to achieve coordination on the risk-dominant strategy in symmetric 2 × 2 coordination games. The "persistant randomness" which is necessary to achieve similar coordination with global interaction is replaced under local interaction by spatial variation in the initial condition. An extension of the risk-dominance idea gives the same convergence result for K × K games with strategic complementarities. Similar results for K × K pure coordination games and potential games are also presented. Journal of Economic Literature Classification Number: C78.     

Stochastic strategy adjustment in coordination games

Summary. The paper explores a model of equilibrium selection in coordination games, where agents from an infinite population stochastically adjust their strategies to changes in their local environment. Instead of playing perturbed best-response, it is assumed that agents follow a rule of ‘switching to better strategies with higher probability’. This behavioral rule is related to bounded-rationality models of Rosenthal (1989) and Schlag (1998). Moreover, agents stay with their strategy in case they successfully coordinate with their local neighbors. Our main results show that both strict Nash equilibria of the coordination game correspond to invariant distributions of the process, hence evolution of play is not ergodic but instead depends on initial conditions. However, coordination on the risk-dominant equilibrium occurs with probability one whenever the initial fraction contains infinitely many agents, independent of the spatial distribution of these agents. Received: March 14, 2000; revised version: June 21, 2001     

Repeated Games with Almost-Public Monitoring

In repeated games with imperfect public monitoring, players can use public signals to coordinate their behavior, and thus support cooperative outcomes, but with private monitoring, such coordination may no longer be possible. Even though grim trigger is a perfect public equilibrium (PPE) in games with public monitoring, it often fails to be an equilibrium in arbitrarily close games with private monitoring. If a PPE has players' behavior conditioned only on finite histories, then it induces an equilibrium in all close-by games with private monitoring. This implies a folk theorem for repeated games with almost-public almost-perfect monitoring. Journal of Economic Literature Classification Numbers: C72, C73.     

Conventions and Local Interaction Structures: Experimental Evidence

We present a series of experimental coordination games with a payoff-dominant and a risk-dominant Nash equilibrium. We examine how much local interaction structures affect players' strategy choices. Our three major observations are the following: First, local interaction with open neighborhoods along a circle leads to less coordination on the payoff-dominant equilibrium than interaction in closed neighborhoods. Second, when players are allocated around a circle, the neighborhood size has, in the long run, no effect on the players' strategy choices. Third, with the same neighborhood size, players allocated on a lattice tend less than players allocated around a circle to coordinate on the payoff-dominant equilibrium. This is true even though the players are given exactly the same instructions. Journal of Economic Literature Classification Numbers: C72, C92.     

Minimum-Effort Coordination Games: Stochastic Potential and Logit Equilibrium

This paper revisits the minimum-effort coordination game with a continuum of Pareto-ranked Nash equilibria. Noise is introduced via a logit probabilistic choice function. The resulting logit equilibrium distribution of decisions is unique and maximizes a stochastic potential function. In the limit as the noise vanishes, the distribution converges to an outcome that is analogous to the risk-dominant outcome for 2 × 2 games. In accordance with experimental evidence, logit equilibrium efforts decrease with increases in effort costs and the number of players, even though these parameters do not affect the Nash equilibria. Journal of Economic Literature Classification Numbers: C72, C92.     

Computationally restricted unmediated talk under incomplete information

Summary. We show the role of unmediated talk with computational complexity bounds as both an information transmission and a coordination device for the class of two-player games with incomplete information and rational parameters. We prove that any communication equilibrium payoff of such games can be reached as a Bayesian-Nash equilibrium payoff of the game extended by a two phase universal mechanism of interim computationally restricted pre-play communication. The communication protocols are designed with the help of modern cryptographic tools. A familiar context in which our results could be applied is bilateral trading with incomplete information.Received: 9 September 2002, Revised: 14 March 2003, JEL Classification Numbers: C72. Correspondence to: Amparo UrbanoWe wish to thank financial aid from the Valencian Institute of Economic Research (IVIE) and partial support by DIGCYT under project PB95 - 1074. A previous version of this work appears as IVIE Working Paper WP-AD 99-07, under the title: "Unmediated talk under incomplete information".     

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.      

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.     

Equilibrium selection through incomplete information in coordination games: an experimental study

We perform an experiment on a pure coordination game with uncertainty about the payoffs. Our game is closely related to models that have been used in many macroeconomic and financial applications to solve problems of equilibrium indeterminacy. In our experiment, each subject receives a noisy signal about the true payoffs. This game (inspired by the “global” games of Carlsson and van Damme, Econometrica, 61, 989–1018, 1993) has a unique strategy profile that survives the iterative deletion of strictly dominated strategies (thus a unique Nash equilibrium). The equilibrium outcome coincides, on average, with the risk-dominant equilibrium outcome of the underlying coordination game. In the baseline game, the behavior of the subjects converges to the theoretical prediction after enough experience has been gained. The data (and the comments) suggest that this behavior can be explained by learning. To test this hypothesis, we use a different game with incomplete information, related to a complete information game where learning and prior experiments suggest a different behavior. Indeed, in the second treatment, the behavior did not converge to equilibrium within 50 periods in some of the sessions. We also run both games under complete information. The results are sufficiently similar between complete and incomplete information to suggest that risk-dominance is also an important part of the explanation.      

Scale functions in equilibrium selection games

We present here an evolutionary game model, and address the issue of equilibrium selection working with the scale function of a diffusion process describing the dynamics of population processes with mutation modeled as white noise. This model is the same as the one in Foster and Young (1990) but with a different interpretation at the boundaries and with different mutation modelings. First, we justifiably assume that the boundaries of the solution of the stochastic differential equation are absorbing so that the first boundary of the interval [0,1] hit will determine the equilibrium selected. Then, working with the scale function, we obtain for 2×2 symmetric games and different mutation parameters, some new and interesting equilibrium selection results. The aim of this article is to describe another method of approach in evolutionary games with mutation which we believe will prove to be very useful in studying more general normal form games and different mutation modelings.