Bargaining over the interference channel with total power constraints

Authors:
Ephraim Zehavi;Amir Leshem
Affiliations:
School of Engineering, Bar-Ilan University, Ramat-Gan, Israel;School of Engineering, Bar-Ilan University, Ramat-Gan, Israel and Faculty of EEMCS, Delft University of Technology, Delft, The Netherlands
Venue:
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Year:
2009

Citing 6
Cited 1

Bargaining Strategies for Networked Multimedia Resource Management

IEEE Transactions on Signal Processing - Part I
Iterative water-filling for Gaussian vector multiple-access channels

IEEE Transactions on Information Theory
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

IEEE Transactions on Information Theory
Distributed multiuser power control for digital subscriber lines

IEEE Journal on Selected Areas in Communications
Competition Versus Cooperation on the MISO Interference Channel

IEEE Journal on Selected Areas in Communications
Cooperative Game Theory and the Gaussian Interference Channel

IEEE Journal on Selected Areas in Communications

Cooperative resource allocation games under spectral mask and total power constraints

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

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.