Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

Two players can make use of a trusted third party who mediates and partially resolves their conflict. Usually, the mediator should be aware of the situation and give suggestions to the players accordingly. However, a corrupt mediator can have a big influence on the outcome of the game. We single...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

We show that essentially every communication equilibrium of any finite Bayesian game with two players can be implemented as a strategic form correlated equilibrium of an extended game, in which before choosing actions as in the Bayesian game, the players engage in a pos-sibly infinitely long...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

We prove that a social choice function is repeatedly implementable if and only if it is dynamically monotonic when the number of agents is at least three. We show how to test dynamic monotonicity by building an associated repeated game. It follows that a weaker version of Maskin monotonicity is...

A competition authority has an objective, which specifies what output profile firms need to produce as a function of production costs. These costs change over time and are only known by the firms. The objective is implementable if inequilibrium, the firms cannot collude on their reports to the...