TCS
2011
12 years 11 months ago
2011
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...
MST
2011
12 years 11 months ago
2011
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...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
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 ...
PPL
2006
13 years 4 months ago
2006
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...
SODA
2007
ACM
13 years 6 months ago
2007
ACM
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...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
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...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
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 ...