Coordination failure in repeated games with almost-public monitoring

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in such games. It is always possible to coordinate continuation play by requiring behavior to have bounded recall (i.e., there is a bound L such that in any period, the last L signals are sufficient to determine behavior). We show that, in games with general almost-public private monitoring, this is essentially the only behavior that can coordinate continuation play.Repeated games, private monitoring, almost-public monitoring, coordination, bounded recall

Coordination Failure in Repeated Games with Almost-Public Monitoring

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public-monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in such games. It is always possible to coordinate continuation play by requiring behavior to have bounded recall (i.e., there is a bound L such that in any period, the last L signals are sufficient to determine behavior). We show that, in games with general almost-public private monitoring, this is essentially the only behavior that can coordinate continuation play.repeated games, private monitoring, almost-public monitoring, coordination, bounded recall

Coordination Failure in Repeated Games with Almost-Public Monitoring

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public-monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in such games. It is always possible to coordinate continuation play by requiring behavior to have bounded recall (i.e., there is a bound L such that in any period, the last L signals are sufficient to determine behavior). We show that, in games with general almost-public private monitoring, this is essentially the only behavior that can coordinate continuation play.Repeated games, Private monitoring, Almost-public monitoring, Coordination, Bounded recall

Coordination Failure in Repeated Games with Almost-Public Monitoring

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in such games. It is always possible to coordinate continuation play by requiring behavior to have bounded recall (i.e., there is a bound L such that in any period, the last L signals are sufficient to determine behavior). We show that, in games with general almost-public private monitoring, this is essentially the only behavior that can coordinate continuation play.repeated games, private monitoring, almost-public monitoring, coordination, bounded recall

Learning from failure

We study decentralized learning in organizations. Decentralization is captured through a symmetry constraint on agents’ strategies. Among such attainable strategies, we solve for optimal and equilibrium strategies. We model the organization as a repeated game with imperfectly observable actions. A fixed but unknown subset of action profiles are successes and all other action profiles are failures. The game is played until either there is a success or the time horizon is reached. For any time horizon, including infinity, we demonstrate existence of optimal attainable strategies and show that they are Nash equilibria. For some time horizons, we can solve explicitly for the optimal attainable strategies and show uniqueness. The solution connects the learning behavior of agents to the fundamentals that characterize the organization: Agents in the organization respond more slowly to failure as the future becomes more important, the size of the organization increases and the probability of success decreases.Game theory

Communication in Dynastic Repeated Games: `Whitewashes' and `Coverups

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. Past information is therefore conveyed from one cohort to the next by means of communication. When communication is costless and messages are sent simultaneously, communication mechanisms or protocols exist that sustain the same set of equilibrium payoffs as in the standard repeated game. When communication is costless but sequential, the incentives to `whitewash' the unobservable past history of play become pervasive. These incentives to whitewash can only be countered if some player serves as a `neutral historian' who verifies the truthfulness of others' reports while remaining indifferent in the process. By contrast, when communication is sequential and (lexicographically) costly, all protocols admit only equilibria that sustain stage Nash equilibrium payoffs. We also analyze a centralized communication protocol in which history leaves a `footprint' that can only hidden by the current cohort by a unanimous `coverup'. We show that in this case only weakly renegotiation proof payoffs are sustainable in equilibrium.Dynastic Repeated Games, Communication, Whitewashing, Coverups

Informational Smallness and Privae Momnitoring in Repeated Games, Second Version

We consider repeated games with private monitoring that are .close. to repeated games with public/perfect monitoring. A private monitoring information structure is close to a public monitoring information structure when private signals can generate approximately the same distribution of the public signal once they are aggregated into a public signal by some public coordination device. A player.s informational size associated with the public coordination device is the key to inducing truth-telling in nearby private monitoring games when communication is possible. A player is informationally small given a public coordination device if she believes that her signal is likely to have a small impact on the public signal generated by the public coordinating device. We show that a uniformly strict equilibrium with public monitoring is robust in a certain sense: it remains an equilibrium in nearby private monitoring repeated games when the associated public coordination device, which makes private monitoring close to public monitoring, keeps every player informationally small at the same time. We also prove a new folk theorem for repeated games with private monitoring and communication by exploiting the connection between public monitoring games and private monitoring games via public coordination devices.Communication, Folk theorem, Informational size, Perfect monitoring, Private monitoring, Public monitoring, Repeated games, Robustness

When and Why? A Critical Survey on Coordination Failure in the Laboratory

Coordination games with Pareto-ranked equilibria have attracted major theoretical attention over the past two decades. Two early path-breaking sets of experimental studies were widely interpreted as suggesting that coordination failure is a common phenomenon in the laboratory. We identify the major determinants that seem to affect the incidence, and/or emergence, of coordination failure in the lab and review critically the existing experimental studies on coordination games with Pareto-ranked equilibria since that early evidence emerged. We conclude that there are many ways to engineer coordination successes.coordination games, Pareto-ranked equilibria, payoff-asymmetric equilibria, staghunt games, optimization incentives, robustness, coordination, coordination failure

Learning from failure

We study decentralized learning in organizations. Decentralization is captured through a symmetry constraint on agents’ strategies. Among such attainable strategies, we solve for optimal and equilibrium strategies. We model the organization as a repeated game with imperfectly observable actions. A fixed but unknown subset of action profiles are successes and all other action profiles are failures. The game is played until either there is a success or the time horizon is reached. For any time horizon, including infinity, we demonstrate existence of optimal attainable strategies and show that they are Nash equilibria. For some time horizons, we can solve explicitly for the optimal attainable strategies and show uniqueness. The solution connects the learning behavior of agents to the fundamentals that characterize the organization: Agents in the organization respond more slowly to failure as the future becomes more important, the size of the organization increases and the probability of success decreases.Game theory