FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Uncertainty-aware and coverage-oriented deployment for sensor networks
Journal of Parallel and Distributed Computing
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Distributed channel management in uncoordinated wireless environments
Proceedings of the 12th annual international conference on Mobile computing and networking
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic Game Theory
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Game Theoretic Approach for Efficient Graph Coloring
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
Operations Research
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Frequency assignments in IEEE 802.11 WLANs with efficient spectrum sharing
Wireless Communications & Mobile Computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Near-optimal observation selection using submodular functions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A survey on networking games in telecommunications
Computers and Operations Research
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Cooperative control and potential games
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Value-aware resource allocation for service guarantees in networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
An architectural view of game theoretic control
ACM SIGMETRICS Performance Evaluation Review
Distributed game-theoretic vertex coloring
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Game-theoretic tools are becoming a popular design choice for distributed resource allocation algorithms. A central component of this design choice is the assignment of utility functions to the individual agents. The goal is to assign each agent an admissible utility function such that the resulting game possesses a host of desirable properties, including scalability, tractability, and existence and efficiency of pure Nash equilibria. In this paper we formally study this question of utility design on a class of games termed distributed welfare games. We identify several utility design methodologies that guarantee desirable game properties irrespective of the specific application domain. Lastly, we illustrate the results in this paper on two commonly studied classes of resource allocation problems: “coverage” problems and “coloring” problems.