Coordination in games with incomplete information: experimental results
We use experiments to study coordination in games with incomplete information and ask whether an informed player can use cheap talk strategically. Two players decide whether to enter a market where stage game payoffs either form a prisoner’s dilemma or a stag-hunt. One player knows which stage game is played while the other knows only the associated probabilities. When players engage in a prisoner’s dilemma each player prefers unilateral entry. When payoffs form a stag-hunt game, the outcome where neither enters Pareto dominates the outcome where both enter. We ask whether cheap talk aids coordination on the Pareto dominant outcome and whether the informed player can use cheap talk to engineer her preferred outcome. Consistent with previous literature, the benefit of cheap talk depends on the relationship between payoffs and risks. We find that cheap talk benefits informed players only when payoff risks are low. Key Words: cheap talk, coordination, experiments, incomplete information, risk dominance, payoff domiance
|Date of creation:||2011|
|Date of revision:|
|Contact details of provider:|| Postal: Thelma C. Raley Hall, Boone, North Carolina 28608|
Web page: http://economics.appstate.edu/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Urs Fischbacher, 2007. "z-Tree: Zurich toolbox for ready-made economic experiments," Experimental Economics, Springer, vol. 10(2), pages 171-178, June.
When requesting a correction, please mention this item's handle: RePEc:apl:wpaper:11-03. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (O. Ashton Morgan)
If references are entirely missing, you can add them using this form.