Bargaining over the interference channel with total power constraints

Ephraim Zehavi*, Amir Leshem

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDMlTDM spectrum allocations and total power constraint. The results improve previous analysis by Han et ale We provide a computationally efficient algorithm as well as detailed analysis of the Karush-Kuhn-Thcker (KKT) equations necessary for proving the correctness of the algorithm. Simulation results demonstrating the gain of the NBS over competitive approaches are also provided.

Original languageEnglish
Title of host publicationProceedings of the 2009 International Conference on Game Theory for Networks, GameNets '09
Pages447-451
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 International Conference on Game Theory for Networks, GameNets '09 - Istanbul, Turkey
Duration: 13 May 200915 May 2009

Publication series

NameProceedings of the 2009 International Conference on Game Theory for Networks, GameNets '09

Conference

Conference2009 International Conference on Game Theory for Networks, GameNets '09
Country/TerritoryTurkey
CityIstanbul
Period13/05/0915/05/09

Keywords

  • Distributed coordination
  • Game theory
  • Interference channel
  • Multiple access channel
  • Power constraint
  • Spectrum optimization

Fingerprint

Dive into the research topics of 'Bargaining over the interference channel with total power constraints'. Together they form a unique fingerprint.

Cite this