Applications of Stationary Anonymous Sequential Games to Multiple Access Control in Wireless Communications

Abstract : We consider in this paper dynamic Multiple Access (MAC) games between a random number of players competing over collision channels. Each of several mobiles involved in an interaction determines whether to transmit at a high or at a low power. High power decreases the lifetime of the battery but results in smaller collision probability. We formulate this game as an anonymous sequential game with undiscounted reward which we recently introduced and which combines features from both population games (infinitely many players) and stochastic games. We briefly present this class of games and basic equilibrium existence results for the total expected reward as well as for the expected average reward. We then apply the theory in the MAC game.
Type de document :
Communication dans un congrès
International Workshop on Wireless Networks: Communication, Cooperation and Competition (WNC3 2014), May 2014, Hammamet, Tunisia. pp.575-578, 2014, <10.1109/WIOPT.2014.6850349 >
Liste complète des métadonnées


https://hal.inria.fr/hal-01006107
Contributeur : Eitan Altman <>
Soumis le : vendredi 13 juin 2014 - 17:06:19
Dernière modification le : jeudi 9 juillet 2015 - 14:41:30
Document(s) archivé(s) le : samedi 13 septembre 2014 - 11:36:34

Fichier

wnc3-piotr.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Eitan Altman, Piotr Wiecek. Applications of Stationary Anonymous Sequential Games to Multiple Access Control in Wireless Communications. International Workshop on Wireless Networks: Communication, Cooperation and Competition (WNC3 2014), May 2014, Hammamet, Tunisia. pp.575-578, 2014, <10.1109/WIOPT.2014.6850349 >. <hal-01006107>

Partager

Métriques

Consultations de
la notice

174

Téléchargements du document

241