{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:18Z","timestamp":1759638618913},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_48","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"547-558","source":"Crossref","is-referenced-by-count":37,"title":["A New Model for Selfish Routing"],"prefix":"10.1007","author":[{"given":"Thomas","family":"L\u00fccking","sequence":"first","affiliation":[]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Rode","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling. In: Proc. of SODA 1997, pp. 493\u2013500 (1997)"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proc. of STOC 2003, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"key":"48_CR3","first-page":"109","volume":"21","author":"M.J. Beckmann","year":"1967","unstructured":"Beckmann, M.J.: On the Theory of Traffic Flow in Networks. Traffic Quart.\u00a021, 109\u2013116 (1967)","journal-title":"Traffic Quart."},{"key":"48_CR4","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxen aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"48_CR6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"A.K. Chandra","year":"1975","unstructured":"Chandra, A.K., Wong, C.K.: Worst-case Analysis of a Placement Algorithm Related to Storage Allocation. SICOMP\u00a04, 249\u2013263 (1975)","journal-title":"SICOMP"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/9.981725","volume":"47","author":"E. Altman","year":"2002","unstructured":"Altman, E., Basar, T., Jimenez, T., Shimkin, N.: Competitive Routing in Networks with Polynomial Costs. IEEE Transactions on Automatic Control\u00a047, 92\u201396 (2002)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/321921.321933","volume":"23","author":"R.A. Cody","year":"1976","unstructured":"Cody, R.A., Coffman Jr., E.G.: Record Allocation for Minimizing Expected Retrieval Costs on Crum-Like Storage Devices. JACM\u00a023, 103\u2013115 (1976)","journal-title":"JACM"},{"key":"48_CR9","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-Case Equilibria. In: Proc. of SODA 2002, pp. 413\u2013420 (2002)"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish Traffic Allocation for Server Farms. In: Proc. of STOC 2002, pp. 287\u2013296 (2002)","DOI":"10.1145\/509948.509952"},{"key":"48_CR11","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 National Bureau of Standards, Series B\u00a073B, 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards, Series B"},{"key":"48_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a Network Creation Game. In: Proc. of PODC 2003, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"48_CR14","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":"48_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-45138-9_2","volume-title":"Mathematical Foundations of Computer Science 2003","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Selfish Routing in Non-Cooperative Networks: A Survey. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 21\u201345. Springer, Heidelberg (2003)"},{"key":"48_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","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)"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: The Structure and Complexity of Extreme Nash Equilibria (2003) (submitted for publication)","DOI":"10.1007\/978-3-540-45208-9_1"},{"key":"48_CR18","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proc. of SIROCCO 2002, pp. 223\u2013235 (2002)"},{"key":"48_CR19","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":"48_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(95)00099-X","volume":"56","author":"J.Y.T. Leung","year":"1995","unstructured":"Leung, J.Y.T., Wei, W.D.: Tighter Bounds on a Heuristic for a Partition Problem. Information Processing Letters\u00a056, 51\u201357 (1995)","journal-title":"Information Processing Letters"},{"key":"48_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-45138-9_49","volume-title":"Mathematical Foundations of Computer Science 2003","author":"T. L\u00fccking","year":"2003","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the Worst-case Nash equilibrium? In: Rovan, B., Vojtas, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"48_CR22","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. In: Proc. of STOC 2001, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"48_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium Points in N-Person Games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"48_CR24","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"48_CR25","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games and the Internet. In: Proc. of STOC 2001, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The Price of Anarchy is Independent of the Network Topology. In: Proc. of STOC 2002, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"48_CR28","unstructured":"Roughgarden, T.: Selfish Routing, Ph. D. Thesis, Department of Computer Science, Cornell University (May 2002)"},{"key":"48_CR29","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? JACM\u00a049, 236\u2013259 (2002)","journal-title":"JACM"},{"key":"48_CR30","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:33:48Z","timestamp":1559612028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}