Skip to main content
Conference Proceedings

Exact price of anarchy for polynomial congestion games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3884 LNCS 218-229
DOI: 10.1007/11672142_17
66Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Aland, S., Dumrauf, D., Gairing, M., Monien, B., & Schoppmann, F. (2006). Exact price of anarchy for polynomial congestion games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3884 LNCS, pp. 218–229). https://doi.org/10.1007/11672142_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free