K-Player Bayesian Waterfilling Game for Fading Multiple Access Channels

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.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00446972
Contributor : Samir Medina Perlaza <>
Submitted on : Wednesday, January 13, 2010 - 6:24:49 PM
Last modification on : Wednesday, May 16, 2018 - 5:08:03 PM
Long-term archiving on : Thursday, June 17, 2010 - 8:49:26 PM

File

C0941.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00446972, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

487

Files downloads

203