Correlated Anarchy in Overlapping Wireless Networks

Panayotis Mertikopoulos 1 Aris L. Moustakas 2
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We investigate the behavior of a large number of selfish users that are able to switch dynamically between multiple wireless access-points (possibly belonging to different standards) by introducing an iterated non-cooperative game. Users start out completely uneducated and na ̈ıve but, by using a fixed set of strategies to process a broadcasted training signal, they quickly evolve and converge to an evolutionarily stable equilibrium. Then, in order to measure efficiency in this steady state, we adapt the notion of the price of anarchy to our setting and we obtain an explicit analytic estimate for it by using methods from statistical physics (namely the theory of replicas). Surprisingly, we find that the price of anarchy does not depend on the specifics of the wireless nodes (e.g. spectral efficiency) but only on the number of strategies per user and a particular combination of the number of nodes, the number of users and the size of the training signal. Finally, we map this game to the well-studied minority game, generalizing its analysis to an arbitrary number of choices.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01382311
Contributor : Panayotis Mertikopoulos <>
Submitted on : Sunday, October 16, 2016 - 3:29:30 PM
Last modification on : Thursday, November 8, 2018 - 2:28:04 PM

Identifiers

  • HAL Id : hal-01382311, version 1

Collections

Citation

Panayotis Mertikopoulos, Aris L. Moustakas. Correlated Anarchy in Overlapping Wireless Networks. IEEE Journal on Selected Areas in Communications, Institute of Electrical and Electronics Engineers, 2008, 26 (7), pp.1160-1169. ⟨hal-01382311⟩

Share

Metrics

Record views

271