Nash codes for noisy channels

Hernández, Penélope and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2014) Nash codes for noisy channels. Operations Research, 62 (6). pp. 1221-1235. ISSN 0030-364X

Preview

PDF - Accepted Version Download (406kB) | Preview

• Author

Abstract

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 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, every code is a Nash code.

Item Type:	Article
Official URL:	http://pubsonline.informs.org/journal/opre
Additional Information:	© 2014 INFORMS
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	17 Nov 2016 11:08
Last Modified:	20 Nov 2024 21:12
Projects:	ECO2010-20584/ECON, PROMETEO/2009/068
Funders:	Spanish Ministry of Science and Technology, FEDER
URI:	http://eprints.lse.ac.uk/id/eprint/68300

Actions (login required)

View Item