The price of anarchy is independent of the network topology

@article{Roughgarden2003ThePO,
  title={The price of anarchy is independent of the network topology},
  author={Tim Roughgarden},
  journal={J. Comput. Syst. Sci.},
  year={2003},
  volume={67},
  pages={341-364}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 52 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 449 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

449 Citations

02040'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 449 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Selfish Routing

T. Roughgarden
PhD thesis, Cornell University • 2002
View 13 Excerpts
Highly Influenced

The economics of welfare

A. C. Pigou
Macmillan • 1920
View 7 Excerpts
Highly Influenced

Stackelberg Scheduling Strategies

SIAM J. Comput. • 2004
View 1 Excerpt

A generic analysis of selfish routing

E. J. Friedman
Working paper • 2001
View 3 Excerpts

Algorithms

C. Papadimitriou
games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749–753 • 2001
View 3 Excerpts

Similar Papers

Loading similar papers…