  Cooperation through repetition is an important theme in game theory. In this
regard, various celebrated ``folk theorems'' have been proposed for repeated
games in increasingly more complex environments. There has, however, been
insufficient attention paid to the robustness of a large set of equilibria that
is needed for such folk theorems. Starting with perfect public equilibrium as
our starting point, we study uniformly strict equilibria in repeated games with
private monitoring and direct communication (cheap talk). We characterize the
limit equilibrium payoff set and identify the conditions for the folk theorem
to hold with uniformly strict equilibrium.
