Repeated games tend to have large sets of equilibria. We also know that in the repeated prisoners dilemma there is a profusion of neutrally stable strategies, but no strategy that is evolutionarily stable. This paper shows that for all of these neutrally stable strategies there is a stepping...

We explore evolutionary dynamics for repeated games with small, but positive complexity costs. To understand the dynamics, we extend a folk theorem result by Cooper (1996) to continuation probabilities, or discount rates, smaller than 1. While this result delineates which payoffs can be...

Epstein (1998) demonstrates that in the demographic Prisoner's Dilemma game it is possible to sustain cooperation in a repeated game played on a finite grid, where agents are spatially distributed and of fixed strategy type ('cooperate' or 'defect'). We introduce a methodology to formalize the...

In this paper I study conditions for the emergence of cooperativebehavior in a dynamic model of population interaction.The model has finitely many individuals located on a circle. The pay-off of each individual is partly based on the (local)interaction with neighbors and partly on (uniform)...

We experimentally investigate a finitely repeated public good game with varying partners. Within each period, participants are pairwise matched and contribute simultaneously. Participants are informed about contributions and each participant evaluates her partner's contribution. At the beginning...

We find that contrary to common perception, cooperation as equilibrium of the infinitely repeated discounted prisoner's dilemma is in many relevant cases not very plausible, or at least questionable: for a significant subset of the payoff-discount factor parameter space cooperation equilibria...

This paper examines characteristics of cooperative behavior in a repeated, n-person, continuous action generalization of a Prisoner's Dilemma game. When time preferences are heterogeneous and bounded away from one, how "much" cooperation can be achieved by an ongoing group? How does group...

In Young (1993, 1998) agents are recurrently matched to play a finite game and almost always play a myopic best reply to a frequency distribution based on a sample from the recent history of play. He proves that in a generic class of finite n-player games, as the mutation rate tends to zero,...

This paper characterizes long-run outcomes for broad classes of symmetric games, when players select actions on the basis of average historical performance. Received wisdom is that when agent's interests are partially opposed, behavior is excessively competitive: ``keeping up with the Jones' ''...