This paper characterizes geometrically the set of all Nash equilibrium payoffs achievable with unmediated communication in persuasion games, i.e., games with an informed expert and an uninformed decisionmaker in which the expert's information is certifiable. The first equilibrium...

In a recent paper, Jäger, Metzger, and Riedel (2011) study communication games of common interest when signals are simple and types complex. They characterize strict Nash equilibria as so-called Voronoi languages that consist of Voronoi tesselations of the type set and Bayesian estimators on...

We study communication in a static Cournot duopoly model under the assumption that the firms have unverifiable private information about their costs. We show that cheap talk between the firms cannot transmit any information. However, if the firms can communicate through a third party,...

This paper studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests with two-sided incomplete information. Private information may concern marginal cost, valuations, and ability. Our main result says that, if the contest is uniformly...

We introduce a form of pre-play communication that we call preopening. During the preopening, players announce their tentative actions to be played in the underlying game. Announcements are made using a posting system which is subject to stochastic failures. Posted actions are publicly...

We introduce a form of pre-play communication that we call preopening. During the preopening, players announce their tentative actions to be played in the underlying game. Announcements are made using a posting system which is subject to stochastic failures. Posted actions are publicly...

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...

Recent literature has questioned the existence of a learning foundation for the partially cursed equilibrium. This paper closes the gap by showing that a partially cursed equilibrium corresponds to a particular analogy-based expectation equilibrium.

We consider a general class of imperfectly discriminating contests with privately informed players. We show that findings by Athey (2001) imply the existence of a Bayesian Nash equilibrium in monotone pure strategies.