2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | G.2.4 | ||
| Paper Title | Achievable Rates for Strategic Communication | ||
| Authors | Anuj S. Vora, Ankur A. Kulkarni, Indian Institute of Technology Bombay, India | ||
| Session | G.2: Game Theory | ||
| Presentation | Lecture | ||
| Track | Graphs, Games, Sparsity, and Signal Processing | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | We introduce the problem of strategic communication and find achievable rates for this problem. The problem consists of a sender that observes a source and a receiver that would like to recover the source. The sender can send messages to the receiver over a noiseless medium whose input space is as large as the space of source signals. However, unlike standard communication, the sender is strategic. Depending on the source signal it receives, the sender may have an incentive, measured by a utility function, to misreport the signal, whereby, not all signals are necessarily recoverable at the receiver. The dilemma for the receiver lies in selecting the right signals to recover so that recovery happens with high probability. We establish achievable rates associated with these settings. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
