Sciweavers

Share
ESA
2010
Springer

Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness

9 years 10 months 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 quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that weighted congestion games are "tight", which implies that the worst-case price of anarchy with respect to pure Nash, mixed Nash, correlated, and coarse correlated equilibria are always equal (under mild conditions on the allowable cost functions). Another is the fact that, like nonatomic but unlike atomic (unweighted) congestion games, weighted congestion games with trivial structure already realize the worst-case POA, at least for polynomial cost functions. We also prove a new result about unweighted congestion games: the worst-case price of anarchy in symmetric games is, as the number of p...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where ESA
Authors Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
Comments (0)
books