Applications of Stationary Anonymous Sequential Games to Multiple Access Control in Wireless Communications - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
wnc3-piotr.pdf (87.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01006107 , version 1 (13-06-2014)

Identifiers

Cite

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, ⟨10.1109/WIOPT.2014.6850349⟩. ⟨hal-01006107⟩

Collections

INRIA INRIA2
189 View
275 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More