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

Ephraim Zehavi; Amir Leshem

doi:10.1109/CAMSAP.2007.4497999

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 proceeding › Conference contribution › peer-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 language	English
Title of host publication	2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP
Pages	197-200
Number of pages	4
DOIs	https://doi.org/10.1109/CAMSAP.2007.4497999
State	Published - 2007
Externally published	Yes
Event	2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP - St. Thomas, Virgin Islands, U.S. Duration: 12 Dec 2007 → 14 Dec 2007

Publication series

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

Conference

Conference	2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP
Country/Territory	Virgin Islands, U.S.
City	St. Thomas
Period	12/12/07 → 14/12/07

Keywords

Distributed coordination
Game theory
Interference channel
Multiple access channel
Spectrum optimization

Access to Document

10.1109/CAMSAP.2007.4497999

Cite this

Zehavi, E., & Leshem, A. (2007). Computing the nash bargaining solution for the 2×2 frequency selective interference channel. In 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP (pp. 197-200). Article 4497999 (2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP). https://doi.org/10.1109/CAMSAP.2007.4497999

@inproceedings{e3ff574b41e841ccbebf95225d9af2d3,

title = "Computing the nash bargaining solution for the 2×2 frequency selective interference channel",

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.",

keywords = "Distributed coordination, Game theory, Interference channel, Multiple access channel, Spectrum optimization",

author = "Ephraim Zehavi and Amir Leshem",

year = "2007",

doi = "10.1109/CAMSAP.2007.4497999",

language = "אנגלית",

isbn = "9781424417148",

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

pages = "197--200",

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

note = "2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP ; Conference date: 12-12-2007 Through 14-12-2007",

}

Zehavi, E & Leshem, A 2007, Computing the nash bargaining solution for the 2×2 frequency selective interference channel. in 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP., 4497999, 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP, pp. 197-200, 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP, St. Thomas, Virgin Islands, U.S., 12/12/07. https://doi.org/10.1109/CAMSAP.2007.4497999

Computing the nash bargaining solution for the 2×2 frequency selective interference channel. / Zehavi, Ephraim; Leshem, Amir.
2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP. 2007. p. 197-200 4497999 (2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Zehavi, Ephraim

AU - Leshem, Amir

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Distributed coordination

KW - Game theory

KW - Interference channel

KW - Multiple access channel

KW - Spectrum optimization

UR - http://www.scopus.com/inward/record.url?scp=50249184745&partnerID=8YFLogxK

U2 - 10.1109/CAMSAP.2007.4497999

DO - 10.1109/CAMSAP.2007.4497999

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:50249184745

SN - 9781424417148

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

SP - 197

EP - 200

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

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

Y2 - 12 December 2007 through 14 December 2007

ER -

Zehavi E, Leshem A. Computing the nash bargaining solution for the 2×2 frequency selective interference channel. In 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP. 2007. p. 197-200. 4497999. (2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP). doi: 10.1109/CAMSAP.2007.4497999

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this