Sciweavers

Share
TCS
2011
8 years 2 months ago
Local and global price of anarchy of graphical games
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 quantifie...
Oren Ben-Zwi, Amir Ronen
MST
2011
184views Hardware» more  MST 2011»
8 years 2 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
SIGECOM
2008
ACM
143views ECommerce» more  SIGECOM 2008»
8 years 7 months ago
Altruism, selfishness, and spite in traffic routing
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
Po-An Chen, David Kempe
PPL
2006
83views more  PPL 2006»
8 years 7 months ago
The Price of Anarchy for Restricted Parallel Links
In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed lin...
Martin Gairing, Thomas Lücking, Marios Mavron...
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
8 years 8 months ago
Strong price of anarchy
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
Nir Andelman, Michal Feldman, Yishay Mansour
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
8 years 11 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
9 years 2 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
books