How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Congestion games with resource reuse and applications in spectrum sharing
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A potential game approach for uplink resource allocation in a multichannel wireless access network
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
An externalities-based decentralized optimal power allocation algorithm for wireless networks
IEEE/ACM Transactions on Networking (TON)
Evolutionary games in wireless networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Near-optimal power control in wireless networks: a potential game approach
INFOCOM'10 Proceedings of the 29th conference on Information communications
On access point association in wireless mesh networks
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Association games in IEEE 802.11 wireless local area networks
IEEE Transactions on Wireless Communications - Part 1
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
Information-Constrained Resource Allocation in Multicamera Wireless Surveillance Networks
IEEE Transactions on Circuits and Systems for Video Technology
Spatial spectrum access game: nash equilibria and distributed learning
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
| Hi-index | 0.00 |
In this paper, we introduce and analyze the properties of a class of games, the atomic congestion games on graphs (ACGGs), which is a generalization of the classical congestion games. In particular, an ACGG captures the spatial information that is often ignored in a classical congestion game. This is useful in many networking problems, e.g., wireless networks where interference among the users heavily depends on the spatial information. In an ACGG, a player's payoff for using a resource is a function of the number of players who interact with it and use the same resource. Such spatial information can be captured by a graph. We study fundamental properties of the ACGGs: under what conditions these games possess a pure strategy Nash equilibrium (PNE), or the finite improvement property (FIP), which is sufficient for the existence of a PNE. We show that a PNE may not exist in general, but that it does exist in many important special cases including tree, loop, or regular bipartite networks. The FIP holds for important special cases including systems with two resources or identical payoff functions for each resource. Finally, we present two wireless network applications of ACGGs: power control and channel contention under IEEE 802.11.