Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

139

Voted

TCS
2011

150views Theoretical Computer Science» more TCS 2011»

Local and global price of anarchy of graphical games

14 years 10 months ago

Local and global price of anarchy of graphical games

Download cs.haifa.ac.il

This paper initiates a study of connections between local and global properties of graphical games. Speciﬁcally, we introduce a concept of local price of anarchy that quantiﬁes 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.

Oren Ben-Zwi, Amir Ronen

Real-time Traffic

Anarchy | Global Properties | Local Price | TCS 2011 | Theoretical Computer Science |

claim paper

Related Content

» Price of Anarchy Locality Gap and a Network Service Provider Game

» Price of Anarchy in NonCooperative Load Balancing

» Tradeoffs and AverageCase Equilibria in Selfish Routing

» Distributed welfare games with applications to sensor coverage

» Existence Theorems and Approximation Algorithms for Generalized Network Security Games

» Basic network creation games

» Cost of Cooperation for Scheduling Meetings

» On Pure and approximate Strong Equilibria of Facility Location Games

» Locally Informed Global Search for Sums of Combinatorial Games

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Oren Ben-Zwi, Amir Ronen

Comments (0)