K-Player Bayesian Waterfilling Game for Fading Multiple Access Channels - CentraleSupélec Access content directly
Conference Papers Year : 2009

K-Player Bayesian Waterfilling Game for Fading Multiple Access Channels

He Gaoning
  • Function : Author
Merouane Debbah
  • Function : Author
  • PersonId : 863308
Samson Lasaulce

Abstract

We present a Bayesian game-theoretic approach for the distributed resource allocation problem in the context of K-user fading multiple access channels (MAC). We assume that users have incomplete information about the channel state information (CSI), i.e., each user knows his own channel state, but does not know the states of other users. All users (transmitters) are considered to be rational, selfish, and each one carries the objective of maximizing its own achievable data rate. In such a game-theoretic study, the central question is whether a Bayesian equilibrium (BE) exists. Based on the assumption of two channel states, we prove that there exists exactly one BE in this game.
Fichier principal
Vignette du fichier
C0941.pdf (100.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00446972 , version 1 (13-01-2010)

Identifiers

  • HAL Id : hal-00446972 , version 1

Cite

He Gaoning, Merouane Debbah, Samson Lasaulce. K-Player Bayesian Waterfilling Game for Fading Multiple Access Channels. 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Dec 2009, Netherlands. 4 p. ⟨hal-00446972⟩
88 View
313 Download

Share

Gmail Facebook X LinkedIn More