Cooperative game theory and the Gaussian interference channel

Amir Leshem*, Ephraim Zehavi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

105 Scopus citations

Abstract

In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. We show that the Nash bargaining solution can be computed using convex optimization techniques. We also show that the same results are applicable to interference channels where only statistical knowledge of the channel is available. Moreover, for the special case of two player 2 × K frequency selective channel (with K frequency bins) we provide an O(K log2 K) complexity algorithm for computing the Nash bargaining solution under mask constraint and using joint FDM/TDM strategies. Simulation results are also provided.

Original languageAmerican English
Article number4604734
Pages (from-to)1078-1088
Number of pages11
JournalIEEE Journal on Selected Areas in Communications
Volume26
Issue number7
DOIs
StatePublished - Sep 2008
Externally publishedYes

Bibliographical note

Funding Information:
Manuscript received August 15, 2007; revised March 10, 2008. Part of this work has been presented at ISIT 2006 [1] and CAMSAP 2007. This work was supported by Intel Corporation. The authors are with the School of Engineering, Bar-Ilan University, Ramat-Gan, 52900, Israel (e-mail: leshema@eng.biu.ac.il). Digital Object Identifier 10.1109/JSAC.2008.080906.

Keywords

  • Distributed coordination
  • Game theory
  • Interference channel
  • Multiple access channel
  • Nash bargaining solution
  • Spectrum optimization

Fingerprint

Dive into the research topics of 'Cooperative game theory and the Gaussian interference channel'. Together they form a unique fingerprint.

Cite this