Name
Abstract | ||
|---|---|---|
We show exact values for the worst-case price of anarchy in weighted and unweighted (atomic unsplittable) congestion games, provided that all cost functions are bounded-degree polynomials with nonnegative coefficients. The given values also hold for weighted and unweighted network congestion games. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1137/090748986 | STACS |
Keywords | Field | DocType |
price of anarchy | Mathematical economics,Polynomial,Latency (engineering),Computer science,Game theory,Network congestion,Retard,Price of anarchy,Traffic congestion | Journal |
Volume | Issue | ISSN |
40 | 5 | 0097-5397 |
Citations | PageRank | References |
51 | 2.01 | 28 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Aland | 1 | 69 | 4.35 |
| Dominic Dumrauf | 2 | 71 | 5.06 |
| Martin Gairing | 3 | 633 | 47.14 |
| Burkhard Monien | 4 | 2199 | 279.35 |
| Florian Schoppmann | 5 | 285 | 13.36 |