{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T12:06:53Z","timestamp":1768392413384,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406716","type":"print"},{"value":"9783540451389","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_2","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"21-45","source":"Crossref","is-referenced-by-count":21,"title":["Selfish Routing in Non-cooperative Networks: A Survey"],"prefix":"10.1007","author":[{"given":"R.","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Gairing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"L\u00fccking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Rode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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":"2_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0166-218X(96)00036-4","volume":"72","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Werner, F.: Improving local search heuristics for some scheduling problems. part II. Discrete Applied Mathematics\u00a072, 47\u201369 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR3","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 and London (1956)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM Journal on Computing\u00a09(1), 91\u2013103 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR6","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413\u2013420 (2002)"},{"issue":"2","key":"2_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 National Bureau of Standards, Series B\u00a073B(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards, Series B"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselmann, A., Mansour, Y.: Convergence time to nash equilibria. In: Proc. of the 30th International Colloquium on Automata, Languages, and Programming, ICALP 2003 (2003)","DOI":"10.1007\/3-540-45061-0_41"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 selish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719. Springer, Heidelberg (2003)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"2_CR11","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 selish 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":"2_CR12","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Papdimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. In: Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, pp. 218\u2013227 (2000)","DOI":"10.1145\/335305.335332"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"D.K. Friesen","year":"1987","unstructured":"Friesen, D.K.: Tighter bounds for lpt scheduling on uniform processors. SIAM Journal on Computing\u00a016(3), 554\u2013560 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR14","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fcocking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Extreme nash equilibria. Technical report, FLAGS-TR-03-10, University of Paderborn (2002)","DOI":"10.1007\/978-3-540-45208-9_1"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A. Haurie","year":"1985","unstructured":"Haurie, A., Marcotte, P.: On the relatonship between nash-cournot and wardrop equilibria. Networks\u00a015, 295\u2013308 (1985)","journal-title":"Networks"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM\u00a034(1), 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR20","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":"2_CR21","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"issue":"7","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/49.414643","volume":"13","author":"Y.A. Korilis","year":"1995","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications\u00a013(7), 1241\u20131251 (1995)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR23","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.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"2_CR24","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proc. of the 9th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2002 (2002) (accepted for TOCS)"},{"key":"2_CR25","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., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. In: Proc. ofthe 28th Annual Symposium on Foundations of Computer Science (FOCS 1987), pp. 217\u2013224 (1987)","DOI":"10.1109\/SFCS.1987.8"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"McKelvey, R.D., McLennan, A.: Computation of equilibria in inite games. In: Amman, H., Kendrick, D., Rust, J. (eds.) Handbook of Computational Economics (1996)","DOI":"10.1016\/S1574-0021(96)01004-0"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selish routing. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals ofMathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals ofMathematics"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for selish agents. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 1\u201315. Springer, Heidelberg (1999)"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","first-page":"129","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol.\u00a0888, pp. 129\u2013140. Springer, Heidelberg (1999)"},{"key":"2_CR32","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)"},{"issue":"3","key":"2_CR33","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Science\u00a048(3), 498\u2013532 (1994)","journal-title":"Journal of Computer and System Science"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","first-page":"749","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol.\u00a0888, pp. 749\u2013753. Springer, Heidelberg (2001)"},{"key":"2_CR35","volume-title":"The economics of \u2019welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The economics of \u2019welfare. Macmillan, Basingstoke (1920)"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing Networks for Selfish Users is Hard. In: Proc. of the 42nd Annual ACM Symposium on Foundations of Computer Science (FOCS 2001), pp. 472\u2013481 (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The Price of Anarchy is Independent of the Network Topology. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"2_CR39","unstructured":"Schulz, A.S., Stier Moses, N.E.: On The Performance of User Equilibria in Traffic Networks. MIT Sloan School of Management Working Paper No. 4274-02 (2002)"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-45535-3_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Schuurman","year":"2001","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of load search for multiprocessor scheduling. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 370\u2013382. Springer, Heidelberg (2001)"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:22:47Z","timestamp":1635553367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}