We study a variant of the repeated Prisoner's Dilemma with uncertain horizon, in which each player chooses his foresight ability: that is, the timing in which he is informed about the realized length of the interaction. In addition, each player has an independent probability to observe the...

We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a small fraction of the population to be commitment types....

Various papers have presented folk theorem results for repeated games with private monitoring that rely on belief-free equilibria. I show that these equilibria are not robust against small perturbations in the behavior of potential opponents. Specifically, I show that essentially none of the...

We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable in the prisoner's dilemma. By contrast, when k 1 we...

This study uses k-means clustering to analyze the strategic choices made by participants playing the infinitely repeated prisoner’s dilemma in laboratory experiments. We identify five distinct strategies that closely resemble well-known pure strategies: always defecting, suspicious...