Computing the nash bargaining solution for the 2×2 frequency selective interference channel

Ephraim Zehavi*, Amir Leshem

*Corresponding author for this work

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

1 Scopus citations

Abstract

In this paper we extend our previous work [1] 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 2×2 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.

Original languageAmerican English
Title of host publication2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP
Pages197-200
Number of pages4
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP - St. Thomas, Virgin Islands, U.S.
Duration: 12 Dec 200714 Dec 2007

Publication series

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

Conference

Conference2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP
Country/TerritoryVirgin Islands, U.S.
CitySt. Thomas
Period12/12/0714/12/07

Keywords

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

Fingerprint

Dive into the research topics of 'Computing the nash bargaining solution for the 2×2 frequency selective interference channel'. Together they form a unique fingerprint.

Cite this