We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...

This paper studies discounted stochastic games perfect or imperfect public monitoring and the opportunity to conduct voluntary monetary transfers. We show that for all discount factors every public perfect equilibrium payoff can be implemented with a simple class of equilibria that have a...

We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with...

We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. The set of outcomes that can arise in equilibrium for some information structure is equal to the...

We study a class of continuous-time reputation games between a large player and a population of small players in which the actions of the large player are imperfectly observable. The large player is either a normal type, who behaves strategically, or a behavioral type, who is committed to...

We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with...

We analyze games of incomplete information and offer equilibrium predictions which are valid for all possible private information structures that the agents may have. Our characterization of these robust predictions relies on an epistemic result which establishes a relationship between the set...

We apply the average cost optimality equation to zero-sum Markov games, by considering a simple game with one-sided incomplete information that generalizes an example of Aumann and Maschler (1995). We determine the value and identify the optimal strategies for a range of parameters

Fixing a game with uncertain payoffs, information design identifies the information structure and equilibrium that maximizes the payoff of an information designer. We show how this perspective unifies existing work, including that on communication in games (Myerson (1991)), Bayesian persuasion...

Fixing a game with uncertain payoffs, information design identifies the information structure and equilibrium that maximizes the payoff of an information designer. We show how this perspective unifies existing work, including that on communication in games (Myerson (1991)), Bayesian persuasion...