Bargaining over the interference channel with total power constraints

Ephraim  Zehavi; Amir  Leshem

1st International Conference on Game Theory for Networks

Research Article

Bargaining over the interference channel with total power constraints

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/GAMENETS.2009.5137431,
    author={Ephraim  Zehavi and Amir  Leshem},
    title={Bargaining over the interference channel with total power constraints},
    proceedings={1st International Conference on Game Theory for Networks},
    publisher={IEEE},
    proceedings_a={GAMENETS},
    year={2009},
    month={6},
    keywords={Spectrum optimization distributed coordination game theory interference channel multiple access channel power constraint.},
    doi={10.1109/GAMENETS.2009.5137431}
}

Ephraim Zehavi
Amir Leshem
Year: 2009
Bargaining over the interference channel with total power constraints
GAMENETS
IEEE
DOI: 10.1109/GAMENETS.2009.5137431

Ephraim Zehavi¹, Amir Leshem^1,2

1: School of Engineering, Bar-Ilan University, Ramat-Gan, 52900, Israel
2: Faculty of EEMCS, Delft University of Technology, Delft, 2628CD, The Netherlands

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.

Keywords: Spectrum optimization distributed coordination game theory interference channel multiple access channel power constraint.

Published: 2009-06-26
Publisher: IEEE

: http://dx.doi.org/10.1109/GAMENETS.2009.5137431

Bargaining over the interference channel with total power constraints

Abstract

About EAI

Community

Publish with EAI