Dynamic communication with biased senders

Abstract

We study dynamic games in which senders with state-independent payoffs communicate to a single receiver. Senders' private information evolves according to an aperiodic and irreducible Markov chain. We prove an analog of a folk theorem—that any feasible and individually rational payoff can be approximated in a perfect Bayesian equilibrium if players are sufficiently patient. In particular, there are equilibria in which the receiver makes perfectly informed decisions in almost every period, even if no informative communication can be sustained in the stage game. We conclude that repeated interaction can overcome strategic limits of communication.