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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01006107
Contributor : Eitan Altman <>
Submitted on : Friday, June 13, 2014 - 5:06:19 PM
Last modification on : Saturday, January 27, 2018 - 1:31:42 AM
Long-term archiving on : Saturday, September 13, 2014 - 11:36:34 AM

File

wnc3-piotr.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

355

Files downloads

326