{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:22Z","timestamp":1759638802433,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_19","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"258-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Curse of Sequentiality in Routing Games"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Correa","sequence":"first","affiliation":[]},{"given":"Jasper","family":"de Jong","sequence":"additional","affiliation":[]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"19_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-38768-5_4","volume-title":"Computing and Combinatorics","author":"A Angelucci","year":"2013","unstructured":"Angelucci, A., Bil\u00f2, V., Flammini, M., Moscardelli, L.: On the sequential price of anarchy of isolation games. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 17\u201328. Springer, Heidelberg (2013)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th FOCS, pp. 295\u2013304. IEEE (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: the price of anarchy, universal worst-case examples, and tightness. ACM Trans. Economics Comput. 2(4), Article 14 (2014)","DOI":"10.1145\/2629666"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bilo, V., Flammini, M., Monaco, G., Moscardelli, L.: Some anomalies of farsighted strategic behavior. In: Proceedings of the 10th WAOA, pp. 229\u2013241 (2013)","DOI":"10.1007\/978-3-642-38016-7_19"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Corr\u00e9a, J., de Keijzer, B., de Jong, J., Uetz, M.: The curse of sequentiality in routing games. Technical Report CTIT, University of Twente (2015). http:\/\/eprints.eemcs.utwente.nl\/26301\/","DOI":"10.1007\/978-3-662-48995-6_19"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-38233-8_12","volume-title":"Algorithms and Complexity","author":"J de Jong","year":"2013","unstructured":"de Jong, J., Uetz, M., Wombacher, A.: Decentralized throughput scheduling. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 134\u2013145. Springer, Heidelberg (2013)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-319-13129-0_35","volume-title":"Web and Internet Economics","author":"J de Jong","year":"2014","unstructured":"de Jong, J., Uetz, M.: The sequential price of anarchy for atomic congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 429\u2013434. Springer, Heidelberg (2014)"},{"key":"19_CR10","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. 1563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"DM Kreps","year":"1982","unstructured":"Kreps, D.M., Wilson, R.B.: Sequential equilibria. Econometrica 50, 863\u2013894 (1982)","journal-title":"Econometrica"},{"key":"19_CR12","first-page":"193","volume":"28","author":"HW Kuhn","year":"1953","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. Ann. Math. Stud. 28, 193\u2013216 (1953)","journal-title":"Ann. Math. Stud."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s001820050086","volume":"27","author":"I Milchtaich","year":"1998","unstructured":"Milchtaich, I.: Crowding games are sequentially solvable. Int. J. Game Theory 27, 501\u2013509 (1998)","journal-title":"Int. J. Game Theory"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, \u00c9.: The curse of simultaneity. In: Proceedings of the 3rd ITCS, pp. 60\u201367 (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"19_CR15","volume-title":"An Introduction to Game Theory","author":"MJ Osborne","year":"2003","unstructured":"Osborne, M.J.: An Introduction to Game Theory. Oxford University Press, Oxford (2003)"},{"issue":"2","key":"19_CR16","first-page":"301","volume":"121","author":"R Selten","year":"1965","unstructured":"Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfragetr\u00e4gheit: Teil 1: Bestimmung des Dynamischen Preisgleichgewichts. Zeitschrift f\u00fcr die gesamte Staatswissenschaft 121(2), 301\u2013324 (1965)","journal-title":"Zeitschrift f\u00fcr die gesamte Staatswissenschaft"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:54:03Z","timestamp":1748714043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}