Sciweavers

24 search results - page 1 / 5
» Strong and Pareto Price of Anarchy in Congestion Games
Sort
View
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
13 years 6 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
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
14 years 5 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
13 years 11 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...
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
13 years 10 months ago
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
George Christodoulou, Elias Koutsoupias