We prove a folk theorem for stochastic games with private, almost-perfect monitoring and observable states when the limit set of feasible and individually rational payoffs is independent of the state. This asymptotic state independence holds, for example, for irreducible stochastic games. Our...

We analyze a toy class of two-player repeated games with two-sided incomplete information. In our model, two players are facing independent decision problems and each of them holds information that is potentially valuable to the other player. We study to what extent, and how, information can be...

Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (“online correlation”). In this paper we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose...

We introduce a “dynamic non-equivalent utilities” (DNEU) condition and the notion of dynamic player-specific punishments for a general repeated game with unequal discounting, both naturally generalizing the stationary counterparts in Abreu et al. (1994). We show that if the DNEU condition,...

This paper provides a dual characterization of the existing ones for the limit set of perfect public equilibrium payoffs in a class of finite stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg et al. (1994),...

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions...

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...

We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into contiguous cells. We give a full characterization of...

We experimentally assess the predictive power of two equilibrium selection principles for binary N-player entry games with strategic complementarities. In static entry games, we test the theory of global games which posits that players play games of complete information as if they were playing a...

In repeated games, subgame perfection requires all continuation strategy profiles must be effective to enforce the equilibrium; they serve as punishments should deviations occur. It does not require whether a punishment can be justified for the deviation, which creates a great deal of freedom in...