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

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

Some labor markets have recently developed formal signalling mechanisms, e.g. the signalling for interviews in the job market for new Ph.D. economists. We evaluate the effect of such mechanisms on two-sided matching markets by considering a game of incomplete information between firms and...

In the past, many refinements have been proposed to select equilibria in cheap talk games. Usually, these refinements were motivated by a discussion of how rational agents would reason in some particular cheap talk games. In this paper, we propose a new refinement and stability measure that is...

The paper analyzes the role of the structure of communication - i.e. who is talking with whom - on the choice of messages, on their credibility and on actual play. We run an experiment in a three-player coordination game with Pareto ranked equilibria, where a pair of agents has a profitable...

Currently no refinement exists that successfully selects equilibria across a wider range of Cheap Talk games. We propose a generalization of refinements based on credible deviations, such as neologism proofness and announcement proofness. According to our Average Credible Deviation Criterion...

We provide a game theoretic analysis of how power shapes the clarity of communication. We analyze information transmission in a cheap talk bargaining game between an informed Sender and an uninformed Receiver. Theoretically, we find that the maximum amount of information that can be transmitted...