Large population potential games

We offer a parsimonious definition of large population potential games, provide some alternate characterizations, and demonstrate the advantages of the new definition over the existing definition, but also show the equivalence of the two definitions.     

Stable games and their dynamics

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the payoffs of strategies which revising agents are abandoning. We prove that the set of Nash equilibria of a stable game is globally asymptotically stable under a wide range of evolutionary dynamics. Convergence results for stable games are not as general as those for potential games: in addition to monotonicity of the dynamics, integrability of the agents' revision protocols plays a key role.     

Stochastic imitation in finite games

In this paper we model an evolutionary process with perpetual random shocks, where individuals sample population-specific strategy-payoff pairs and imitate the most successful behavior. For finite n-player games we prove that in the limit, as the perturbations tend to zero, only strategy-tuples in minimal sets closed under single better replies will be played with positive probability. If the strategy-tuples in one such minimal set have strictly higher payoffs than all outside strategy-tuples, then the strategy-tuples in this set will be played with probability one in the limit, provided the minimal set is a product set and the sample is sufficiently large.     

Uniform selection in global games

This paper brings together results which are required in order to extend the global games approach to settings where the game structure is endogenous. More precisely, it shows that the selection argument of Carlsson and van Damme [Global games and equilibrium selection, Econometrica 61(5) (1993) 989-1018] holds uniformly over appropriately controlled families of games. Those results also give proper justification for the inversion of limits which is often implicit in applied work taking comparative statics on the selected risk-dominant equilibrium.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

Evolution in games with randomly disturbed payoffs

We consider a simple model of stochastic evolution in population games. In our model, each agent occasionally receives opportunities to update his choice of strategy. When such an opportunity arises, the agent selects a strategy that is currently optimal, but only after his payoffs have been randomly perturbed. We prove that the resulting evolutionary process converges to approximate Nash equilibrium in both the medium run and the long run in three general classes of population games: stable games, potential games, and supermodular games. We conclude by contrasting the evolutionary process studied here with stochastic fictitious play.     

Mixed equilibria are unstable in games of strategic complements

In games with strict strategic complementarities, properly mixed Nash equilibria—equilibria that are not in pure strategies—are unstable for a broad class of learning dynamics.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.     

Risk-dominance and perfect foresight dynamics in N-player games

In perfect foresight dynamics, an action is linearly stable if expectation that people will always choose the action is self-fulfilling. A symmetric game is a PIM game if an opponent's particular action maximizes the incentive of an action, independently of the rest of the players. This class includes supermodular games, games with linear incentives and so forth. We show that, in PIM games, linear stability is equivalent to u-dominance, a generalization of risk-dominance, and that there is no path escaping a u-dominant equilibrium. Existing results on N-player coordination games, games with linear incentives and two-player games are obtained as corollaries.     

Evolution in Bayesian games II: Stability of purified equilibria

We study the evolutionary stability of purified equilibria of two-player normal form games, providing simple sufficient conditions for stability and for instability under the Bayesian best response dynamic.     

Multiple equilibria and limit cycles in evolutionary games with Logit Dynamics

This note shows, by means of two simple, three-strategy games, the existence of stable periodic orbits and of multiple, interior steady states in a smooth version of the Best-Response Dynamics, the Logit Dynamics. The main finding is that, unlike Replicator Dynamics, generic Hopf bifurcation and thus, stable limit cycles, occur under the Logit Dynamics, even for three-strategy games. We also show that the Logit Dynamics displays another bifurcation which cannot occur under the Replicator Dynamics: the fold bifurcation, with non-monotonic creation and disappearance of steady states.     

The folk theorem for irreducible stochastic games with imperfect public monitoring

This paper introduces stochastic games with imperfect public signals. It provides a sufficient condition for the folk theorem when the game is irreducible, thus generalizing the results of Dutta (1995) [5] and Fudenberg, Levine, and Maskin (1994) [9]. To do this, the paper extends the concept of self-generation (Abreu, Pearce, and Stacchetti, 1990 [1]) to “return generation,” which explicitly tracks actions and incentives until the next time the state returns to its current value, and asks that players not wish to deviate given the way their continuation payoffs from the time of this return depend on the public signals that have been observed.     

Learning in games with unstable equilibria

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on recent experience, the time average of play often converges in these “unstable” games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equilibrium.     

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.     

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.     

Efficiency results in N player games with imperfect private monitoring

We demonstrate that efficiency is achievable in a certain class of N player repeated games with private, almost perfect monitoring. Our equilibrium requires only one period memory and can be implemented by two state automata. Furthermore, we show that this efficiency result holds with any degree of accuracy of monitoring if private signals are hemiindependent. Whereas most existing research focuses on two player cases or only a special example of N player games, our results are applicable to a wide range of N player games of economic relevance, such as trading goods games and price-setting oligopolies.     

The Nash-threats folk theorem with communication and approximate common knowledge in two player games

We show that the use of communications to coordinate equilibria generates a Nash-threats folk theorem in two-player games with “almost public” information. The results generalize to the n-person case. However, the two-person case is more difficult because it is not possible to sustain equilibria by comparing the reports of different players, and using these “third parties” to effectively enforce contracts.     

Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.     

Testing the TASP: An experimental investigation of learning in games with unstable equilibria

We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unstable under learning. The Time Average Shapley Polygon (TASP) predicts behavior in the unstable case. We study two versions of Rock-Paper-Scissors that include a fourth strategy, Dumb. The unique Nash equilibrium is identical in the two games, but the predicted frequency of Dumb is much higher in the game where the NE is stable. Consistent with TASP, the observed frequency of Dumb is lower and play is further from Nash in the high payoff unstable treatment. However, Dumb is played too frequently in all treatments.