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.

• Type: Conference
• Year: 2007
• Where: WINE
• Authors: Martin Gairing, Florian Schoppmann
• Keywords: Economy, Multiple Interesting Cases, Singleton Congestion Games, Unrestricted Strategy Sets, WINE 2007