The Price of Anarchy with Polynomial Edge Latency

dc.contributor.authorRoughgarden, Timen_US
dc.description.abstractWe consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the total latency---is minimized. In many settings, it is not possible to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a ``selfishly motivated'' assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance. In this paper, we prove that if the latency of each edge is a polynomial function of degree at most $p$ of the edge congestion, then the total latency of the routes chosen by selfish network users is at most $[1 - p \cdot (p+1)^{-(p+1)/p}]^{-1} = \Theta(\frac{p}{\ln p})$ times the minimum possible total latency. A simple example shows that this result is best possible for all values of $p$.en_US
dc.format.extent231101 bytes
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleThe Price of Anarchy with Polynomial Edge Latencyen_US
dc.typetechnical reporten_US


Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
225.68 KB
Postscript Files