Mathematics of Information Seminar

Tuesday October 28, 2014 4:00 PM

Nash Codes for Noisy Channels

Speaker: Bernhard von Stengel, Department of Mathematics, London School of Economics
Location: Annenberg 213

When a sender transmits a message as a ''codeword'' over a noisy channel, the receiver's optimal ''decoding'' of the possibly garbled channel output is to identify the message that has most likely been sent. We extend this standard approach by asking if the sender's action is also optimal. That is, given the receiver's decoding strategy, is the sender most likely understood correctly by transmitting the original codeword, rather than any other channel input? A ''Nash code'' has this desirable stability property, where encoding and decoding define a Nash equilibrium in this sender-receiver game with fully aligned interests of the players. We study this concept with examples, and show two sufficient conditions for Nash codes: receiver-optimal codes, and, somewhat surprisingly, _arbitrary_ codes for the classic binary channel (if the receiver breaks ties ''monotonically,'' which holds for generic priors or payoffs). Joint work with Penelope Hernandez (Valencia).

Series Center for the Mathematics of Information Seminar Series

Contact: Linda Taddeo at 626 395 6704 ltaddeo@caltech.edu
For more information visit: http://www.cmi.caltech.edu/events.shtml