Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Nash equilibria in graphical games on trees revisited
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic Game Theory
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
When Ignorance Helps: Graphical Multicast Cost Sharing Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Equilibria and Efficiency Loss in Games on Networks
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04
When ignorance helps: Graphical multicast cost sharing games
Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hi-index | 5.23 |
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.