Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
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. © 2010 Elsevier B.V. All rights reserved.
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Yao Qi, Raja Das, et al.
ISSTA 2009
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Yigal Hoffner, Simon Field, et al.
EDOC 2004