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...

We consider dynamic group formation in repeated n-person prisonerʼs dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process...

Belief models capable of detecting 2- to 5-period patterns in repeated games by matching the current historical context to similar realizations of past play are presented. The models are implemented in a cognitive framework, ACT-R, and vary in how they implement similarity-based...

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...

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...

How can a rational player strategically control a myopic best reply player in a repeated two-player game? We show that in games with strategic substitutes or strategic complements the optimal control strategy is monotone in the initial action of the opponent, in time periods, and in the discount...

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...