Combining a strategy model, an inference procedure and a new experimental design, we map sequences of observed actions in repeated games to unobserved strategies that reflect decision-makers’ plans. We demonstrate the method by studying two institutional settings with distinct theoretical...

This paper considers bidding automata programmed by experienced subjects in sequential first price sealed bid auction experiments. These automata play against each other in computer tournaments. The risk neutral subgame perfect Nash equilibrium strategy of the independent private value model...

We define social institutions as strategies in some repeated game. With this interpretation in mind, we consider the impact of introducing requirements on strategies which have been viewed as necessary properties for any social institution to endure. The properties we study are finite...

We study two-person repeated games in which a player with a restricted set of strategies plays against an unrestricted player. An exogenously given bound on the complexity of strategies, which is measured by the size of the smallest automata that implement them, gives rise to a restriction on...

The evolution of cooperation in the repeated prisoner's dilemma depends on the conditions under which the game is played. The results of a series of computer simulations show that the emergence of cooperative play in the game is strongly affected by the localisations of both interaction and...