Nash Codes for Noisy Channels

Details Nash Codes for Noisy Channels Nash Codes for Noisy Channels

2012-02-07

arxiv.org/abs/1202.1547v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Nash Codes for Noisy Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nash Codes for Noisy Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nash Codes for Noisy Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63598