60 search results - page 1 / 12 » Algorithms for pure Nash equilibria in weighted congestion g... |
JEA
2006
13 years 4 months ago
2006
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
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 ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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 ( ...