Sciweavers

Share
WINE
2007
Springer

Total Latency in Singleton Congestion Games

10 years 3 months ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resource. For singleton congestion games, we provide a collection of upper and lower bounds on the price of anarchy for multiple interesting cases. In our study, we distinguish between restricted and unrestricted strategy sets, between weighted and unweighted player weights, and between linear and polynomial latency functions.
Martin Gairing, Florian Schoppmann
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WINE
Authors Martin Gairing, Florian Schoppmann
Comments (0)
books