We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff set with perfect monitoring and a mediator. We show that this bounding set admits a simple recursive characterization, which nonetheless necessarily involves the use of private strategies. Under our condition, this set describes precisely those payoff vectors that arise in equilibrium for some private monitoring structure if either nonstationary monitoring or communication is allowed
Most theoretical or applied research on repeated games with imper-fect monitoring has restricted att...
We provide a characterization of the limit set of perfect public equilibrium payoffs of repeated gam...
We study repeated games with discounting where perfect monitoring is possible, but costly. It is sho...
We provide simple sufficient conditions for the existence of a tight, recursive upper bound on the s...
In each stage of a repeated game with private monitoring, the players receive payoffs and privately ...
This paper introduces an equilibrium concept called perfect communication equilibrium for repeated g...
We investigate two-player infinitely repeated games where the discount factor is less than but close...
In this paper I prove two folk theorems for repeated games with private information and communicatio...
We prove that there exist equilibrium payoffs arbitrarily close to the efficient payoff in the two-p...
This dissertation studies private information in repeated games with imperfect monitoring. For this ...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
This paper introduces an equilibrium concept called perfect communication equilibrium for repeated g...
This paper investigates general two-player infinitely repeated games where the discount factor is le...
This paper studies repeated games with imperfect public monitoring where the players are uncertain b...
This paper analyzes repeated games in which it is possible for players to observe the other players'...
Most theoretical or applied research on repeated games with imper-fect monitoring has restricted att...
We provide a characterization of the limit set of perfect public equilibrium payoffs of repeated gam...
We study repeated games with discounting where perfect monitoring is possible, but costly. It is sho...
We provide simple sufficient conditions for the existence of a tight, recursive upper bound on the s...
In each stage of a repeated game with private monitoring, the players receive payoffs and privately ...
This paper introduces an equilibrium concept called perfect communication equilibrium for repeated g...
We investigate two-player infinitely repeated games where the discount factor is less than but close...
In this paper I prove two folk theorems for repeated games with private information and communicatio...
We prove that there exist equilibrium payoffs arbitrarily close to the efficient payoff in the two-p...
This dissertation studies private information in repeated games with imperfect monitoring. For this ...
This paper investigates infinitely repeated prisoner-dilemma games, where the discount factor is les...
This paper introduces an equilibrium concept called perfect communication equilibrium for repeated g...
This paper investigates general two-player infinitely repeated games where the discount factor is le...
This paper studies repeated games with imperfect public monitoring where the players are uncertain b...
This paper analyzes repeated games in which it is possible for players to observe the other players'...
Most theoretical or applied research on repeated games with imper-fect monitoring has restricted att...
We provide a characterization of the limit set of perfect public equilibrium payoffs of repeated gam...
We study repeated games with discounting where perfect monitoring is possible, but costly. It is sho...