Bargaining over the interference channel with total power constrain

E. Zehavi, Amir Leshem

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

Abstract

In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constraint. The results improve previous analysis by Han et al.We provide a computationally efficient algorithm as well as detailed analysis of the Karush-Kuhn-Tucker (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 languageAmerican English
Title of host publicationGame Theory for Networks, 2009. GameNets' 09. International Conference on
PublisherIEEE
StatePublished - 2009

Bibliographical note

Place of conference:Turkey

Fingerprint

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

Cite this