We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

Individuals and two-person teams play a hidden - action trust game with pre - play communication. We replicate previous results for individuals that non-binding promises increase cooperation rates. But this does not extend to teams. Wh ile teams make non-binding promises to cooperate at the same...

We design experimental games to evaluate the predictive power of the first cheap‐talk refinement, neologism‐proofness. In our first set of treatments designed to evaluate the refinement with its usual emphasis on literal meanings, we find that a fully revealing equilibrium that is...

We consider an experiment with a version of the Battle of the Sexes game with two-sided private information, allowing a possible round of either one-way or two-way cheap talk before the game is played. We compare different treatments to study truthful revelation of information and subsequent...

We examine communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we introduce two...

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

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

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

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