Markov perfection has become the usual solution concept to determine the non-cooperative equilibrium in a dynamic game. However, Markov perfection is a stronger solution concept than subgame perfection: Markov perfection rules out any cooperation in a repeated prisoners' dilemma game because the...

This paper studies infinitely repeated games where players can form coalitions to coordinate their actions via self-enforcing agreements. The proposed notion of "stable agreements" extends a characterization of the set of subgame perfect equilibrium paths by Greenberg (1989, 1990) to account for...

This paper is concerned with the modeling of strategic change in humans’ behavior when facing different types of opponents. In order to implement this efficiently a mixed experimental setup was used where subjects played a game with a unique mixed strategy Nash equilibrium for 100 rounds...

A concept of dynamic stability in infinitely repeated games with discounting is presented. For this purpose, one modification of the available theory is needed: we need to relax the assumption that the game starts in a given period. Under this new framework, we propose stable strategies such...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu, 1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...

We propose a simple adaptive procedure for playing a game. In this procedure, players depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies (these measures are updated every period). It is shown that our adaptive...

This paper examines strategic adaptation in participants’ behavior conditional on the type of their opponent. Participants played a constant-sum game for 100 rounds against each of three pattern-detecting computer algorithms designed to exploit regularities in human behavior such as...

This paper aspires to fill a conspicuous gap in the literature regarding learning in games — the absence of empirical verification of learning rules involving pattern recognition. Weighted fictitious play is extended to detect two-period patterns in opponents’ behavior and to comply with the...

We illustrate one way in which a population of boundedly rational individuals can learn to play an approximate Nash equilibrium. Players are assumed to make strategy choices using a combination of imitation and innovation. We begin by looking at an imitation dynamic and provide conditions under...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu, 1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...