Total Latency in Singleton Congestion Games
- Cite this paper as:
- Gairing M., Schoppmann F. (2007) Total Latency in Singleton Congestion Games. In: Deng X., Graham F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg
We provide a collection of new upper and lower bounds on the price of anarchy for singleton congestion games. In our study, we distinguish between restricted and unrestricted strategy sets, between weighted and unweighted player weights, and between linear and polynomial latency functions.
Unable to display preview. Download preview PDF.