{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:31:04Z","timestamp":1777541464773,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230250","type":"print"},{"value":"9783540301400","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_30","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"323-334","source":"Crossref","is-referenced-by-count":45,"title":["On the Evolution of Selfish Routing"],"prefix":"10.1007","author":[{"given":"Simon","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC 2003, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"key":"30_CR2","unstructured":"Czumaj, A., Berhold, V.: Tight bounds for worst-case equilibria. In: Proc. 13th SODA, San Francisco, pp. 413\u2013420 (2002)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria (2004) (to appear)","DOI":"10.1145\/1007352.1007445"},{"key":"30_CR4","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":"30_CR5","doi-asserted-by":"crossref","unstructured":"Gairing, M., Luecking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. of the STOC 2004 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A.B. Haurie","year":"1985","unstructured":"Haurie, A.B., Marcotte, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks\u00a015, 295\u2013308 (1985)","journal-title":"Networks"},{"key":"30_CR7","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, p. 404. Springer, Heidelberg (1999)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proc. of STOC 2001, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/246015a0","volume":"246","author":"J. Maynard Smith","year":"1973","unstructured":"Maynard Smith, J., Price, G.R.: The logic of animal conflict. Nature\u00a0246, 15\u201318 (1973)","journal-title":"Nature"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: How useful is old information? In: Proc. of the PODC 1997, pp. 83\u201391 (1997)","DOI":"10.1145\/259380.259426"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in n-person games. In: Proc. of National Academy of Sciences, vol.\u00a036, pp. 48\u201349 (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"30_CR12","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"},{"issue":"2","key":"30_CR13","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? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"30_CR14","volume-title":"Evolutionary Game Theory","author":"J.W. Weibull","year":"1995","unstructured":"Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:38:46Z","timestamp":1740523126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}