A canonical interpretation of an infinitely repeated game is that of a “dynastic” repeated game: a stage game repeatedly played by successive generations of finitely-lived players with dynastic preferences. These two models are in fact equivalent when the past history of play is observable...

We ask whether communication can directly substitute for memory in dynastic repeated games in which short lived individuals care about the utility of their offspring who replace them in an infinitely repeated game. Each individual is unable to observe what happens before his entry in the game....

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...

In a repeated game with private information, a perfect public equilibrium (PPE) can break down if communication is not necessarily simultaneous or if players can “spy” on each others’ information. An ex post perfect public equilibrium (EPPPE) is a PPE that is ex post incentive compatible...

This paper studies the role of memory and communication in games between ongoing organizations. In each organization, each individual, upon entry into the game, replaces his predecessor who has the same preferences and faces the same strategic possibilities. Entry across distinct organizations...

The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information and known own payoffs. If the informed player is arbitrarily patient relative to the uninformed player, then the characterization for the informed player's payoffs is essentially...

This paper applies the theory of equilibrium in mixed strategies in an inspection game model to describe the strategic interaction in the stolen base play in baseball. A parsimonious simultaneous-move game model offers predictions about how the observable conduct of the teams on offense and...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

(less than 25 lines) I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a non-empty, complete lattice. For this purpose I introduce a device that allows the study of the set of...

We analyze the problem of coordinating upon asymmetric equilibria in a symmetric game, such as the battle-of-the-sexes. In repeated interaction, asymmetric coordination is possible possible via symmetric repeated game strategies. This requires that players randomize initially and adopt a...