Exact Price of Anarchy for Polynomial Congestion Games

  • Sebastian Aland
  • Dominic Dumrauf
  • Martin Gairing
  • Burkhard Monien
  • Florian Schoppmann
Conference paper

DOI: 10.1007/11672142_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3884)
Cite this paper as:
Aland S., Dumrauf D., Gairing M., Monien B., Schoppmann F. (2006) Exact Price of Anarchy for Polynomial Congestion Games. In: Durand B., Thomas W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg

Abstract

We show exact values for the price of anarchy of weighted and unweighted congestion games with polynomial latency functions. The given values also hold for weighted and unweighted network congestion games.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sebastian Aland
    • 1
  • Dominic Dumrauf
    • 1
  • Martin Gairing
    • 1
  • Burkhard Monien
    • 1
  • Florian Schoppmann
    • 1
  1. 1.Department of Computer Science, Electrical Engineering and MathematicsUniversity of PaderbornPaderbornGermany

Personalised recommendations