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.
Type de document :
Communication dans un congrès
3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Dec 2009, Netherlands. 4 p., 2009
Liste complète des métadonnées

https://hal-supelec.archives-ouvertes.fr/hal-00446972
Contributeur : Samir Medina Perlaza <>
Soumis le : mercredi 13 janvier 2010 - 18:24:49
Dernière modification le : mercredi 16 mai 2018 - 17:08:03
Document(s) archivé(s) le : jeudi 17 juin 2010 - 20:49:26

Fichier

C0941.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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., 2009. 〈hal-00446972〉

Partager

Métriques

Consultations de la notice

467

Téléchargements de fichiers

136