DMCA
The price of anarchy is independent of the network topology (2002)
Cached
Download Links
- [www.cs.cornell.edu]
- [www.cs.stanford.edu]
- [www.cs.cornell.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES |
| Citations: | 217 - 17 self |
BibTeX
@INPROCEEDINGS{Roughgarden02theprice,
author = {Tim Roughgarden},
title = {The price of anarchy is independent of the network topology},
booktitle = {JOURNAL OF COMPUTER AND SYSTEM SCIENCES},
year = {2002},
pages = {428--437},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to selfishly route traffic on minimumlatency paths. The quality of a routing of traffic is measured by the sum of travel times, also called the total latency. The outcome of selfish routing—a Nash equilibrium—does not in general minimize the total latency; hence, selfish behavior carries the cost of decreased network performance. We quantify this degradation in network performance via the price of anarchy, the worst-possible ratio between the total latency of a Nash equilibrium and of an optimal routing of the traffic. We show the price of anarchy is determined only by the simplest of networks. Specifically, we prove that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a singlecommodity
Keyphrases
total latency nash equilibrium network topology selfish behavior network performance decreased network performance network user travel time edge congestion route traffic minimumlatency path weak hypothesis multicommodity flow network optimal routing noncooperative network user worst-possible ratio selfish routing allowable edge latency function network traffic worst-case ratio
