Shannon Meets Nash on the Interference Channel

The interference channel is the simplest communication scenario where multiple autonomous users compete for shared resources. We combine game theory and information theory to define the notion of a Nash equilibrium region of the interference channel. The notion is game theoretic: it captures the selfish behavior of each user as they compete. The notion is also information theoretic: it allows each user to use arbitrary communication strategies as it optimizes its own performance. We give an exact characterization of the Nash equilibrium region of the two-user linear deterministic interference channel and an approximate characterization of the Nash equilibrium region of the two-user Gaussian interference channel to within 1 bit/s/Hz.

[1]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Venugopal V. Veeravalli,et al.  Sum capacity of the Gaussian interference channel in the low interference regime , 2008, 2008 Information Theory and Applications Workshop.

[3]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[4]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[5]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[6]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[7]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[8]  Wei Yu,et al.  Competitive equilibrium in the Gaussian interference channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[9]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[10]  Roy D. Yates,et al.  Secret communication on interference channels , 2008, 2008 IEEE International Symposium on Information Theory.

[11]  Suvarup Saha,et al.  On information theoretic interference games with more than two users , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[12]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[13]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[14]  David Tse,et al.  Information theoretic games on interference channels , 2008, 2008 IEEE International Symposium on Information Theory.

[15]  Venugopal V. Veeravalli,et al.  Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region , 2009, IEEE Trans. Inf. Theory.

[16]  David Tse,et al.  Information theory meets game theory on the interference channel , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[17]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

[18]  David Tse,et al.  The two-user Gaussian interference channel: a deterministic view , 2008, Eur. Trans. Telecommun..

[19]  S. T. Chung,et al.  A game-theoretic approach to power allocation in frequency-selective gaussian interference channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[20]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

[21]  Max H. M. Costa,et al.  The capacity region of a class of deterministic interference channels , 1982, IEEE Trans. Inf. Theory.

[22]  Ephraim Zehavi,et al.  Bargaining Over the Interference Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.