Computing The Nash Bargaining Solution for the 2X2 Frequency Selective Interference Channel

Author

Zehavi, Ephraim ; Leshem, Amir

Author_Institution

Sch. of Eng., Bar-Ilan Univ., Ramat-Gan

fYear

2007

fDate

12-14 Dec. 2007

Firstpage

197

Lastpage

200

Abstract

In this paper we extend our previous work analyzing the interference channel as a conflict situation to frequency selective channels and joint TDM/FDM strategies. We provide an O(K log K) complexity algorithm for computing the Nash bargaining solution under mask constraint for the 2times2 frequency selective interference channel (with K frequency bins) under joint FDM/TDM strategies. Simulation results are also provided. We also show the convexity of the N players game with similar strategies.

Keywords

computational complexity; decision theory; frequency division multiplexing; game theory; interference (signal); telecommunication channels; time division multiplexing; FDM; Nash bargaining solution; TDM; computational complexity; frequency selective interference channel; game theory; Computational modeling; Frequency; Game theory; Interference channels; Interference constraints; NIST; Nash equilibrium; Region 1; Time division multiplexing; Waste materials; Spectrum optimization; distributed coordination; game theory; interference channel; multiple access channel;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Advances in Multi-Sensor Adaptive Processing, 2007. CAMPSAP 2007. 2nd IEEE International Workshop on

Conference_Location

St. Thomas, VI

Print_ISBN

978-1-4244-1713-1

Electronic_ISBN

978-1-4244-1714-8

Type

conf

DOI

10.1109/CAMSAP.2007.4497999

Filename

4497999