{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T03:44:58Z","timestamp":1783223098252,"version":"3.54.6"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0022-0000(03)00044-8","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T19:51:31Z","timestamp":1054065091000},"page":"341-364","source":"Crossref","is-referenced-by-count":280,"title":["The price of anarchy is independent of the network topology"],"prefix":"10.1016","volume":"67","author":[{"given":"Tim","family":"Roughgarden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00044-8_BIB1","series-title":"Studies in the Economics of Transportation","author":"Beckmann","year":"1956"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB2","series-title":"Data Networks","author":"Bertsekas","year":"1992"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB3","doi-asserted-by":"crossref","unstructured":"A. Czumaj, P. Krysta, B. V\u00f6cking, Selfish traffic allocation for server farms, in: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, Montreal, Canada, 2002, pp. 287\u2013296.","DOI":"10.1145\/509948.509952"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB4","unstructured":"A. Czumaj, B. V\u00f6cking, Tight bounds for worst-case equilibria, in: Proceedings of the 13th Annual Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 413\u2013420."},{"issue":"2","key":"10.1016\/S0022-0000(03)00044-8_BIB5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","article-title":"The traffic assignment problem for a general network","volume":"73B","author":"Dafermos","year":"1969","journal-title":"J. Res. Nat. Bur. Standards Ser. B"},{"issue":"1","key":"10.1016\/S0022-0000(03)00044-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.11.1.1","article-title":"Inefficiency of Nash equilibria","volume":"11","author":"Dubey","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0022-0000(03)00044-8_BIB7","unstructured":"E.J. Friedman, A generic analysis of selfish routing, Working paper, Cornell University, 2001."},{"key":"10.1016\/S0022-0000(03)00044-8_BIB8","series-title":"Queuing Theory","author":"Gross","year":"1998"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB9","series-title":"A Second Course in Stochastic Processes","author":"Karlin","year":"1981"},{"issue":"3","key":"10.1016\/S0022-0000(03)00044-8_BIB10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/9.557575","article-title":"Capacity allocation under noncooperative routing","volume":"42","author":"Korilis","year":"1997","journal-title":"IEEE Trans. Automat. Control"},{"issue":"1","key":"10.1016\/S0022-0000(03)00044-8_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1239\/jap\/1032374242","article-title":"Avoiding the Braess paradox in noncooperative networks","volume":"36","author":"Korilis","year":"1999","journal-title":"J. Appl. Probab."},{"key":"10.1016\/S0022-0000(03)00044-8_BIB12","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, 1999, pp. 404\u2013413.","DOI":"10.1007\/3-540-49116-3_38"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB13","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/90.650145","article-title":"Virtual path bandwidth allocation in multiuser networks","volume":"5","author":"Lazar","year":"1997","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"10.1016\/S0022-0000(03)00044-8_BIB14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1016770831869","article-title":"Atomic resource sharing in noncooperative networks","volume":"17","author":"Libman","year":"2001","journal-title":"Telecomm. Systems"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB15","doi-asserted-by":"crossref","unstructured":"M. Mavronicolas, P. Spirakis, The price of selfish routing, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 2001, pp. 510\u2013519.","DOI":"10.1145\/380752.380846"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB16","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/90.251910","article-title":"Competitive routing in multi-user communication networks","volume":"1","author":"Orda","year":"1993","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB17","series-title":"Game Theory","author":"Owen","year":"1995"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB18","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, Algorithms, games, and the Internet, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 2001, pp. 749\u2013753.","DOI":"10.1145\/380752.380883"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB19","series-title":"The Economics of Welfare","author":"Pigou","year":"1920"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB20","series-title":"Prisoner's Dilemma","author":"Rapoport","year":"1965"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB21","unstructured":"T. Roughgarden, The price of anarchy for the maximum latency of selfish routing, unpublished."},{"key":"10.1016\/S0022-0000(03)00044-8_BIB22","doi-asserted-by":"crossref","unstructured":"T. Roughgarden, Designing networks for selfish users is hard, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, pp. 472\u2013481.","DOI":"10.1109\/SFCS.2001.959923"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB23","doi-asserted-by":"crossref","unstructured":"T. Roughgarden, Stackelberg scheduling strategies, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 2001, pp. 104\u2013113.","DOI":"10.1145\/380752.380783"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB24","doi-asserted-by":"crossref","unstructured":"T. Roughgarden, Selfish Routing, Ph.D. Thesis, Cornell University, 2002.","DOI":"10.1145\/506147.506153"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB25","unstructured":"T. Roughgarden, \u00c9. Tardos, Bounding the inefficiency of equilibria in nonatomic congestion games, Technical Report TR2002-1866, Cornell University, 2002."},{"issue":"2","key":"10.1016\/S0022-0000(03)00044-8_BIB26","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","article-title":"How bad is selfish routing?","volume":"49","author":"Roughgarden","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB27","series-title":"Principles of Mathematical Analysis","author":"Rudin","year":"1976"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB28","unstructured":"A.S. Schulz, N. Stier Moses, Performance of user equilibria in traffic networks, in: Proceedings of the 14th Annual Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 86\u201387."},{"key":"10.1016\/S0022-0000(03)00044-8_BIB29","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB30","doi-asserted-by":"crossref","unstructured":"A. Vetta, Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, Vancouver, Canada, 2002, pp. 416\u2013425.","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"10.1016\/S0022-0000(03)00044-8_BIB31","doi-asserted-by":"crossref","unstructured":"J.G. Wardrop, Some theoretical aspects of road traffic research, in: Proceedings of the Institute of Civil Engineers, London, Part II, Vol. 1, 1952, pp. 325\u2013378.","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T02:54:08Z","timestamp":1553136848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0022000003000448"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00044-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}