Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:0708.0846 (cs)
[Submitted on 6 Aug 2007]

Title:Cooperative game theory and the Gaussian interference channel

Authors:Amir Leshem, Ephi Zehavi
View PDF
Abstract: In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies.
We show that the Nash bargaining solution can be computed using convex optimization techniques. We also show that the same results are applicable to interference channels where only statistical knowledge of the channel is available. Moreover, for the special case of two players $2\times K$ frequency selective channel (with K frequency bins) we provide an $O(K \log_2 K)$ complexity algorithm for computing the Nash bargaining solution under mask constraint and using joint FDM/TDM strategies. Simulation results are also provided.
Subjects: Information Theory (cs.IT); Computer Science and Game Theory (cs.GT)
Cite as: arXiv:0708.0846 [cs.IT]
  (or arXiv:0708.0846v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.0708.0846

Submission history

From: Amir Leshem [view email]
[v1] Mon, 6 Aug 2007 21:47:10 UTC (428 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2007-08
Change to browse by:
cs
cs.GT
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Amir Leshem
Ephraim Zehavi
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)