We compare communication about private information to communication about actions in a one-shot 2-person public good game with private information.The informed player, who knows the exact return from contributing and whose contribution is unobserved, can send a message about the return or her...

We compare communication about private information to communication about actions in a one-shot 2-person public good game with private information. The informed player, who knows the exact return from contributing and whose contribution is unobserved, can send a message about the return or her...

We study equilibrium reporting behavior in Fischbacher and Föllmi-Heusi (2013)-type cheating games when agents have a fixed cost of lying and image concerns not to be perceived as a liar. We show that equilibria naturally arise in which agents with low costs of lying randomize among a set of...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

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

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

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

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 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 study experimentally persuasion games in which a sender (e.g., a seller) with private information provides verifiable but potentially vague information (e.g., about the quality of a product) to a receiver (e.g., a buyer). Various theoretical solution concepts such as sequential equilibrium or...