This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated...

We analyze information design games between two designers with opposite preferences and a single agent. Before the agent makes a decision, designers repeatedly disclose public information about persistent state parameters. Disclosure continues until no designer wishes to reveal further...

We consider a dynamic principal-agent problem, where the sole instrument the principal has to incentivize the agent is the disclosure of information. The principal aims at maximizing the (discounted) number of times the agent chooses the principal's preferred action. We show that there exists an...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...

This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated...

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 extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated...

Le maxmin pour une certaine classe de jeux répétés à observation imparfaite est obtenu comme la solution d'un problème d'optimisation défini sur l'ensemble des distributions de probabilités sous contraintes d'entropie. Cette article offre une méthode pour résoudre un tel problème dans...

This paper studies finitely repeated games with semi-standard monitoring played in pure strategies. In these games, each player's action set is endowed with a partition, and the equivalence classes of the actions played are publicly observed. We characterize the limit set of equilibrium payoffs...

This paper studies finitely repeated games with semi-standard monitoring played in pure strategies. In these games, each player's action set is endowed with a partition, and the equivalence classes of the actions played are publicly observed. We characterize the limit set of equilibrium payoffs...