{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T13:13:11Z","timestamp":1790687591102,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540261995","type":"print"},{"value":"9783540321026","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_13","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"167-181","source":"Crossref","is-referenced-by-count":55,"title":["On the Inefficiency of Equilibria in Congestion Games"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicol\u00e1s E.","family":"Stier-Moses","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Studies in the Economics of Transportation","author":"M.J. Beckmann","year":"1956","unstructured":"Beckmann, M.J., Mcguire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"13_CR2","unstructured":"Bureau of Public Roads: Traffic assignment manual. U.S. Department of Commerce, Urban Planning Division, Washington, DC (1964)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1287\/trsc.25.3.240","volume":"25","author":"S. Catoni","year":"1991","unstructured":"Catoni, S., Pallotino, S.: Traffic equilibrium paradoxes. Transportation Science\u00a025, 240\u2013244 (1991)","journal-title":"Transportation Science"},{"key":"13_CR4","unstructured":"Chakrabarty, D.: Improved bicriteria results for the selfish routing problem (2004) (Manuscript)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0167-6377(03)00030-0","volume":"31","author":"C.K. Chau","year":"2003","unstructured":"Chau, C.K., Sim, K.M.: The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Operations Research Letters\u00a031, 327\u2013334 (2003)","journal-title":"Operations Research Letters"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research\u00a029, 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR7","first-page":"91","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the U.S. National Bureau of Standards\u00a073B, 91\u2013118 (1969)","journal-title":"Journal of Research of the U.S. National Bureau of Standards"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S.C., Spirakis, P.G.: Selfish unsplittable flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1287\/trsc.22.1.39","volume":"22","author":"P.T. Harker","year":"1988","unstructured":"Harker, P.T.: Multiple equilibrium behaviors of networks. Transportation Science\u00a022, 39\u201346 (1988)","journal-title":"Transportation Science"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02392210","volume":"115","author":"G. Hartman","year":"1966","unstructured":"Hartman, G., Stampacchia, G.: On some nonlinear elliptic differential equations. Acta Mathematica\u00a0115, 271\u2013310 (1966)","journal-title":"Acta Mathematica"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Jahn, O., M\u00f6hring, R.H., Schulz, A.S., Stier-Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Operations Research (2005) (to appear)","DOI":"10.1287\/opre.1040.0197"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1287\/moor.25.3.349.12220","volume":"25","author":"I. Milchtaich","year":"2000","unstructured":"Milchtaich, I.: Generic uniqueness of equilibrium in large crowding games. Mathematics of Operations Research\u00a025, 349\u2013364 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/S0022-0531(03)00106-6","volume":"114","author":"I. Milchtaich","year":"2004","unstructured":"Milchtaich, I.: Social optimality and cooperation in nonatomic congestion games. Journal of Economic Theory\u00a0114, 56\u201387 (2004)","journal-title":"Journal of Economic Theory"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A. Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE\/ACM Transactions on Networking\u00a01, 510\u2013521 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Greece, pp. 749\u2013753. ACM Press, New York (2001)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-25960-2_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Perakis","year":"2004","unstructured":"Perakis, G.: The \u201cprice of anarchy\u201d under nonlinear and asymmetric costs. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 46\u201358. Springer, Heidelberg (2004)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/863955.863974","volume-title":"Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM)","author":"L. Qiu","year":"2003","unstructured":"Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in internet-like environments. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), Karlsruhe, Germany, pp. 151\u2013162. ACM Press, New York (2003)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences\u00a067, 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR21","first-page":"973","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish routing with atomic players. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, Canada, pp. 973\u2013974. SIAM, Philadelphia (2005)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049, 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, \u00c9.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior\u00a047, 389\u2013403 (2004)","journal-title":"Games and Economic Behavior"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01014905","volume":"7","author":"D. Schmeidler","year":"1973","unstructured":"Schmeidler, D.: Equilibrium points of nonatomic games. Journal of Statistical Physics\u00a07, 295\u2013300 (1973)","journal-title":"Journal of Statistical Physics"},{"key":"13_CR25","first-page":"86","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A.S. Schulz","year":"2003","unstructured":"Schulz, A.S., Stier-Moses, N.E.: On the performance of user equilibria in traffic networks. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, pp. 86\u201387. SIAM, Philadelphia (2003)"},{"key":"13_CR26","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0191-2615(79)90022-5","volume":"13B","author":"M.J. Smith","year":"1979","unstructured":"Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transportation Research\u00a013B, 295\u2013304 (1979)","journal-title":"Transportation Research"},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, Part II\u00a01, 325\u2013378 (1952)","journal-title":"Proceedings of the Institution of Civil Engineers, Part II"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T11:30:46Z","timestamp":1635679846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11496915_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}