Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Spectrum Allocation from a Game Theoretic Perspective: Properties of Nash Equilibria
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2298-6774
2008 (English)In: 2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4 / [ed] Matthews MB, New York: IEEE , 2008, 1542-1546 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a scenario consisting of two transmit-receive pairs coexisting in the same area and communicating using the same portion of the spectrum. Applying a game theoretic framework, each pair is regarded as a player whose payoff function is the individual link rate and power is allocated using the iterative water-filling algorithm. We study the dynamics of such a game and find properties of the resulting Nash equilibria. For high interference scenarios, operating points admitting complete, partial or no overlap are possible and we present conditions under which the different Nash equilibria are achievable. Based on this analysis, a modified water-filling algorithm is designed to increase the sum-rate of the communication links. Its performance is compared to that of the iterative water-filling algorithm by numerical simulations. Although we restrict the analysis to a two player game, analogous concepts can be used to design decentralized algorithms for scenarios with more players.

Place, publisher, year, edition, pages
New York: IEEE , 2008. 1542-1546 p.
Series
CONFERENCE RECORD OF THE ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, ISSN 1058-6393
Keyword [en]
Algorithm design and analysis, DSL, Game theory, Interference channels, Iterative algorithms, Nash equilibrium, Numerical simulation, Signal processing algorithms, Transmitters
National Category
Computer and Information Science Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-30202DOI: 10.1109/ACSSC.2008.5074680ISI: 000274551001075Scopus ID: 2-s2.0-70349653360ISBN: 978-1-4244-2940-0 (print)OAI: oai:DiVA.org:kth-30202DiVA: diva2:400656
Conference
42nd Asilomar Conference on Signals, Systems and Computers Pacific Grove, CA, OCT 26-29, 2008
Note
QC 20110228Available from: 2011-02-28 Created: 2011-02-21 Last updated: 2012-01-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
von Wrycza, PeterShankar, M. R. BhavaniBengtsson, MatsOttersten, Björn
By organisation
Signal ProcessingACCESS Linnaeus Centre
Computer and Information ScienceTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 63 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf