{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:10:27Z","timestamp":1736280627394,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_4","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"41-54","source":"Crossref","is-referenced-by-count":8,"title":["The Hardness of Network Design for Unsplittable Flow with Selfish Users"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th ACM Symp. on Theory of Computing (to appear, 2005)"},{"key":"4_CR2","volume-title":"Studies in Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"4_CR3","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: Uber ein paradoxon der verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th ACM Symp. on Theory of Computing (to appear, 2005)","DOI":"10.1145\/1060590.1060600"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proc. 34th ACM Symp. on Theory of Computing, pp. 287\u2013296 (2002)","DOI":"10.1145\/509948.509952"},{"key":"4_CR6","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pp. 413\u2013420 (2002)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.11.1.1","volume":"11","author":"P. Dubey","year":"1986","unstructured":"Dubey, P.: Inefficiency of nash equilibria. Mathematics of Operations Research\u00a011(1), 1\u20138 (1986)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.C.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010(2), 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","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., Spirakis, P.: 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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proc. 16th Symp. on Theoretical Aspects of Comp. Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0041-1647(70)90196-6","volume":"4","author":"J.D. Murchland","year":"1970","unstructured":"Murchland, J.D.: Braess\u2019s paradox of traffic flow. Transportation Research\u00a04, 391\u2013394 (1970)","journal-title":"Transportation Research"},{"key":"4_CR13","volume-title":"Computers and Intractabilty: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractabilty: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in n-person games. In: Proceedings of National Academy of Sciences, vol.\u00a036, pp. 48\u201349 (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"4_CR15","volume-title":"Game Theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game Theory, 3rd edn. Academic Press, London (1995)","edition":"3"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games and the internet. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"4_CR17","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 possesing pure-strategy nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: Proc. 42nd IEEE Symp. on Found. of Comp. Science, pp. 472\u2013481 (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proc. 34th ACM Symp. on Theory of Computing, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"4_CR20","unstructured":"Roughgarden, T.: The maximum latency of selfish routing. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 973\u2013974 (2004)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing. In: Proc. 41st IEEE Symp. on Found. of Comp. Science, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T19:29:45Z","timestamp":1736278185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11671411_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}