{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:54:20Z","timestamp":1772297660419,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221135","type":"print"},{"value":"9783540259602","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_5","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"59-73","source":"Crossref","is-referenced-by-count":25,"title":["Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s E.","family":"Stier Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"511","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC)","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Desgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, pp. 511\u2013520. ACM Press, New York (2003)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research\u00a020, 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Beccaria, G., Bolelli, A.: Modelling and assessment of dynamic route guidance: The MARGOT project. In: Proceedings of the IEEE Vehicle Navigation & Information Systems Conference, Oslo, Norway, pp. 117\u2013126 (1992)","DOI":"10.1109\/VNIS.1992.639943"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. MIT, Sloan School of Management, Working Paper No. 4319-03. To appear in Mathematics of Operations Research (2003)","DOI":"10.2139\/ssrn.420520"},{"key":"5_CR7","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A.: Selfish routing on the Internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton (2004) (to appear)"},{"key":"5_CR8","first-page":"287","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC)","author":"A. Czumaj","year":"2002","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, Canada, pp. 287\u2013296. ACM Press, New York (2002)"},{"key":"5_CR9","first-page":"413","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Czumaj","year":"2002","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 413\u2013420. SIAM, Philadelphia (2002)"},{"key":"5_CR10","doi-asserted-by":"crossref","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)","DOI":"10.6028\/jres.073B.010"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45465-9_12"},{"key":"5_CR13","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. MIT, Sloan School of Management, Working Paper No. 4394-02 (2002)","DOI":"10.2139\/ssrn.364200"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-45749-6_53","volume-title":"Algorithms - ESA 2002","author":"E. K\u00f6hler","year":"2002","unstructured":"K\u00f6hler, E., Langkau, K., Skutella, M.: Time-expanded graphs with flowdependent transit times. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 599\u2013611. Springer, Heidelberg (2002)"},{"key":"5_CR15","first-page":"174","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"E. K\u00f6hler","year":"2002","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 174\u2013183. SIAM, Philadelphia (2002)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory of Computing Systems\u00a036, 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"5_CR17","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":"5_CR18","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/380752.380846","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Mavronicolas","year":"2001","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Greece, pp. 510\u2013519. ACM Press, New York (2001)"},{"key":"5_CR19","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","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, Hersonissos, Greece, pp. 749\u2013753. ACM Press, New York (2001)"},{"key":"5_CR20","series-title":"Handbook in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Networks","author":"W.B. Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Networks. Handbook in Operations Research and Management Science, vol.\u00a04, pp. 141\u2013295. Elsevier Science, Amsterdam (1995)"},{"key":"5_CR21","first-page":"203","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 203\u2013204. SIAM, Philadelphia (2002)"},{"key":"5_CR22","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":"5_CR23","first-page":"973","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: The maximum latency of selfish routing. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, pp. 973\u2013974. SIAM, Philadelphia (2004)"},{"key":"5_CR24","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":"5_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":"5_CR26","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institution of Civil Engineers, vol.\u00a01, Part II, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"},{"key":"5_CR27","unstructured":"Weitz, D.: The price of anarchy (2001) (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T02:14:26Z","timestamp":1635992066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}