In this work, we consider Wardrop games where traffic has to be routed through a shared network. Traffic is allowed to be split into arbitrary pieces and can be modeled as network flow. For each edge in the network there is a latency function that specifies the time needed to traverse the edge given its congestion. In a Wardrop equilibrium, all used paths between a given source-destination pair have equal and minimal latency. In this paper, we allow for polynomial latency functions with an upper bound d and a lower bound s on the degree of all monomials that appear in the polynomials. For this environment, we prove upper and lower bounds on the price of anarchy. © 2006 Springer-Verlag.
CITATION STYLE
Dumrauf, D., & Gairing, M. (2006). Price of anarchy for polynomial wardrop games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4286 LNCS, pp. 319–330). https://doi.org/10.1007/11944874_29
Mendeley helps you to discover research relevant for your work.