Total Latency in Singleton Congestion Games

  • Martin Gairing
  • Florian Schoppmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4858)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Martin Gairing
    • 1
  • Florian Schoppmann
    • 2
  1. 1.International Computer Science Institute, Berkeley, CAUSA
  2. 2.International Graduate School of Dynamic Intelligent Systems, University of Paderborn, PaderbornGermany

Personalised recommendations