15 search results - page 1 / 3 » Symmetry in Network Congestion Games: Pure Equilibria and An... |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
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 ...
STOC
2005
ACM
14 years 4 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 ( ...
ESA
2010
Springer
13 years 5 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
2009
ACM
14 years 5 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...