It is shown that, for almost every two-player game with imperfect monitoring, the conclusions of the classical folk theorem are false. So, even though these games admit a well-known approximate folk theorem, an exact folk theorem may only be obtained for a measure zero set of games. A complete characterization of the efficient equilibria of almost every such game is also given, along with an inefficiency result on the imperfect monitoring prisoner s dilemma
We consider an infinitely repeated prisoner's dilemma under costly monitoring. If a player observes...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. ...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
The folk theorem of repeated games has established that cooperative behavior can be sustained as an ...
This paper investigates infinitely repeated prisoner-dilemma games where the discount factor is less...
In this paper, we prove that, under full rank, every perfect public equilibrium payoff (above some N...
We study repeated games where players can make costly investments in mon-itoring and improve quality...
International audienceWe prove the folk theorem for discounted repeated games under private, almost-...
We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private mon...
We present a repeated prisoners ’ dilemma game with imperfect pub-lic monitoring, which exhibits the...
We adapt the methods from Abreu, Pearce and Stacchetti (1990) to finitely repeated games with imperfe...
The present paper shows that the Folk Theorem under imperfect (public) information (Fudenberg, Levin...
This note presents three results on repeated games. First, players can be better off with imperfect ...
We consider an infinitely repeated prisoner's dilemma under costly monitoring. If a player observes...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. ...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
The folk theorem of repeated games has established that cooperative behavior can be sustained as an ...
This paper investigates infinitely repeated prisoner-dilemma games where the discount factor is less...
In this paper, we prove that, under full rank, every perfect public equilibrium payoff (above some N...
We study repeated games where players can make costly investments in mon-itoring and improve quality...
International audienceWe prove the folk theorem for discounted repeated games under private, almost-...
We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private mon...
We present a repeated prisoners ’ dilemma game with imperfect pub-lic monitoring, which exhibits the...
We adapt the methods from Abreu, Pearce and Stacchetti (1990) to finitely repeated games with imperfe...
The present paper shows that the Folk Theorem under imperfect (public) information (Fudenberg, Levin...
This note presents three results on repeated games. First, players can be better off with imperfect ...
We consider an infinitely repeated prisoner's dilemma under costly monitoring. If a player observes...
Various papers have presented folk-theorem results that yield efficiency in the repeated Prisoner's ...
We study the repeated two-player Prisoners' Dilemma with imperfect private monitoring and no communi...