We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private monitoring. From this follows a limit folk theorem: when players are patient and monitoring is sufficiently accurate, (but private and possibly independent) any feasible individually rational payoff can be obtained in sequential equilibrium. The strategies used can be implemented by finite (randomizing) automata. Journal of Economic Literature Classification Numbers: C72, C73, D82
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. ...
We present a repeated prisoners ’ dilemma game with imperfect pub-lic monitoring, which exhibits the...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...
We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private mon...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
This paper investigates infinitely repeated prisoner-dilemma games where the discount factor is less...
The folk theorem of repeated games has established that cooperative behavior can be sustained as an ...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
We consider an infinitely repeated prisoner's dilemma under costly monitoring. If a player observes...
We study repeated games where players can make costly investments in mon-itoring and improve quality...
We study infinitely repeated anonymous random matching games played by communities of players, who o...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
This dissertation studies private information in repeated games with imperfect monitoring. For this ...
I study repeated games with mediated communication and frequent actions. I derive a Folk Theorem und...
We establish two Folk Theorems for the repeated prisoners' dilemma with limited memory strategies a...
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. ...
We present a repeated prisoners ’ dilemma game with imperfect pub-lic monitoring, which exhibits the...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...
We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private mon...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
This paper investigates infinitely repeated prisoner-dilemma games where the discount factor is less...
The folk theorem of repeated games has established that cooperative behavior can be sustained as an ...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
We consider an infinitely repeated prisoner's dilemma under costly monitoring. If a player observes...
We study repeated games where players can make costly investments in mon-itoring and improve quality...
We study infinitely repeated anonymous random matching games played by communities of players, who o...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
This dissertation studies private information in repeated games with imperfect monitoring. For this ...
I study repeated games with mediated communication and frequent actions. I derive a Folk Theorem und...
We establish two Folk Theorems for the repeated prisoners' dilemma with limited memory strategies a...
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. ...
We present a repeated prisoners ’ dilemma game with imperfect pub-lic monitoring, which exhibits the...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...