Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Ben-Zwi, O., & Ronen, A. (2008). The local and global price of anarchy of graphical games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4997 LNCS, pp. 255–266). https://doi.org/10.1007/978-3-540-79309-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
