Nash Codes for Noisy Channels
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or ``Nash code'' results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for Nash codes. First, a receiver-optimal code defines a Nash code. A second, more surprising observation holds for communication over a binary channel which is used independently a number of times, a basic model of information transmission: Under a minimal ``monotonicity'' requirement for breaking ties when decoding, which holds generically, any code is a Nash code.
References listed on IDEAS
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.:
- Crawford, Vincent P & Sobel, Joel, 1982.
"Strategic Information Transmission,"
Econometric Society, vol. 50(6), pages 1431-51, November.
- Pawlowitsch, Christina, 2008. "Why evolution does not always lead to an optimal signaling system," Games and Economic Behavior, Elsevier, vol. 63(1), pages 203-226, May.
- Oliver Board & Andreas Blume, 2008.
365, University of Pittsburgh, Department of Economics, revised Aug 2008.
- Warneryd Karl, 1993. "Cheap Talk, Coordination, and Evolutionary Stability," Games and Economic Behavior, Elsevier, vol. 5(4), pages 532-546, October.
- Penelope Hernandez & Amparo Urbano Salvador & Jose E. Vila, 2010. "Nash Equilibrium and information transmission coding and decoding rules," Discussion Papers in Economic Behaviour 0910, University of Valencia, ERI-CES.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
- Jacob Glazer & Ariel Rubinstein, 2004. "On Optimal Rules of Persuasion," Econometrica, Econometric Society, vol. 72(6), pages 1715-1736, November.
- Hernández, Penélope & Urbano, Amparo & Vila, José E., 2012.
"Pragmatic languages with universal grammars,"
Games and Economic Behavior,
Elsevier, vol. 76(2), pages 738-752.
- Frederic Koessler, 2000.
"Common Knowledge and Consensus with Noisy Communication,"
Econometric Society World Congress 2000 Contributed Papers
0887, Econometric Society.
- Koessler, Frederic, 2001. "Common knowledge and consensus with noisy communication," Mathematical Social Sciences, Elsevier, vol. 42(2), pages 139-159, September.
- Frédéric Koessler, 2000. "Common knowledge and consensus with noisy communication," Working Papers of BETA 2000-05, Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg.
- Rubinstein, Ariel & Glazer, Jacob, 2006. "A study in the pragmatics of persuasion: a game theoretical approach," Theoretical Economics, Econometric Society, vol. 1(4), pages 395-410, December.
- Spence, A Michael, 1973. "Job Market Signaling," The Quarterly Journal of Economics, MIT Press, vol. 87(3), pages 355-74, August.
- Gerhard Jäger & Lars Koch-Metzger & Frank Riedel, 2009. "Voronoi languages: Equilibria in cheap-talk games with high-dimensional types and few signals," Center for Mathematical Economics Working Papers 420, Center for Mathematical Economics, Bielefeld University.
- Emir Kamenica & Matthew Gentzkow, 2011. "Bayesian Persuasion," American Economic Review, American Economic Association, vol. 101(6), pages 2590-2615, October.
When requesting a correction, please mention this item's handle: RePEc:dbe:wpaper:0912. 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: (Emilio Calvo Ramón)
If references are entirely missing, you can add them using this form.