A dynamic random access game with energy constraints
Author(s)
Menache, Ishai; Altman, Eitan; Basar, Tamer; Tembine, Hamidou
DownloadAltaian-2009-A dynamic random access game with energy constraints.pdf (2.069Mb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
We study a dynamic random access game with a finite number of opportunities for transmission and with energy constraints. We provide sufficient conditions for feasible strategies and for existence of Nash-Pareto solutions and show that finding Nash-Pareto policies of the dynamic random access game is equivalent to partitioning the set of time slot opportunities with constraints into a set of terminals. We further derive upper bounds for pure Nash-Pareto policies, and extend the study to non-integer energy constraints and unknown termination time, where time division multiplexing policies can be suboptimal. We show that the dynamic random access game has several strong equilibria (resilient to coalition of any size), and we compute them explicitly. We introduce the (strong) price of anarchy concept to measure the gap between the payoff under strong equilibria and the social optimum.
Date issued
2009-10Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2009. WiOPT 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Altman, E. et al. “A dynamic random access game with energy constraints.” Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2009. WiOPT 2009. 7th International Symposium on. 2009. 1-7. © 2009 IEEE
Version: Final published version
ISBN
978-1-4244-4919-4
Keywords
Dynamic game, TDM policy, multiple access control, strong equilibria