The price of anarchy is independent of the network topology
- 19 May 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 428-437
- https://doi.org/10.1145/509907.509971
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- How bad is selfish routing?Journal of the ACM, 2002
- Algorithms, games, and the internetPublished by Association for Computing Machinery (ACM) ,2001
- Stackelberg scheduling strategiesPublished by Association for Computing Machinery (ACM) ,2001
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- Avoiding the Braess paradox in non-cooperative networksJournal of Applied Probability, 1999
- Capacity allocation under noncooperative routingIEEE Transactions on Automatic Control, 1997
- Virtual path bandwidth allocation in multiuser networksIEEE/ACM Transactions on Networking, 1997
- Competitive routing in multiuser communication networksIEEE/ACM Transactions on Networking, 1993
- Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1969
- CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952