The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
On spectrum selection games in cognitive radio networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
COMAS: a cooperative multiagent architecture for spectrum sharing
EURASIP Journal on Wireless Communications and Networking
A game theoretical study of access point association in wireless mesh networks
Computer Communications
Decentralised channel allocation and information sharing for teams of cooperative agents
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Atomic congestion games on graphs and their applications in networking
IEEE/ACM Transactions on Networking (TON)
Femtocells sharing management using mobility prediction model
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Hi-index | 0.00 |
In this paper we consider an extension to the classical definition of congestion games (CG) in which multiple users share the same set of resources and their payoff for using any resource is a function of the total number of users sharing it. The classical congestion games enjoy some very appealing properties, including the existence of a Nash equilibrium and that every improvement path is finite and leads to such a NE (also called the finite improvement property or FIP), which is also a local optimum to a potential function. On the other hand, this class of games does not model well the congestion or resource sharing in a wireless context, a prominent feature of which is spatial reuse. What this translates to in the context of a congestion game is that a user's payoff for using a resource (interpreted as a channel) is a function of the its number of its interfering users sharing that channel, rather than the total number among all users. This makes the problem quite different. We will call this the congestion game with resource reuse (CG-RR). In this paper we study intrinsic properties of such a game; in particular, we seek to address under what conditions on the underlying network this game possesses the FIP or NE. We also discuss the implications of these results when applied to wireless spectrum sharing.