Sciweavers

19 search results - page 1 / 4
» The price of anarchy of finite congestion games
Sort
View
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
14 years 11 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»
14 years 5 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»
14 years 4 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
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
14 years 8 days ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
MST
2010
98views more  MST 2010»
13 years 9 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis