{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:31:30Z","timestamp":1764937890325,"version":"3.40.5"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_9","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:17Z","timestamp":1747468037000},"page":"119-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Price of\u00a0Anarchy in\u00a0Packet Routing Games with\u00a0FIFO"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7776-3426","authenticated-orcid":false,"given":"Daniel","family":"Schmand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5947-0172","authenticated-orcid":false,"given":"Torben","family":"Sch\u00fcrenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4241-6584","authenticated-orcid":false,"given":"Martin","family":"Strehler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"9_CR1","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 12, 258\u2013268 (1968). https:\/\/doi.org\/10.1007\/BF01918335","journal-title":"Unternehmensforschung"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Cao, Z., Chen, B., Chen, X., Wang, C.: A network game of dynamic traffic. In: Daskalakis, C., Babaioff, M., Moulin, H. (eds.) Proceedings of the 2017 ACM Conference on Economics and Computation, EC \u201917, Cambridge, MA, USA, 26\u201330 June 2017, pp. 695\u2013696. ACM (2017). https:\/\/doi.org\/10.1145\/3033274.3085101","DOI":"10.1145\/3033274.3085101"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1287\/moor.2021.1242","volume":"47","author":"Z Cao","year":"2022","unstructured":"Cao, Z., Chen, B., Chen, X., Wang, C.: Bounding residence times for atomic dynamic routings. Math. Oper. Res. 47(4), 3261\u20133281 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1242","journal-title":"Math. Oper. Res."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-22012-8_44","volume-title":"Automata, Languages and Programming","author":"R Cominetti","year":"2011","unstructured":"Cominetti, R., Correa, J.R., Larr\u00e9, O.: Existence and uniqueness of equilibria for flows over time. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 552\u2013563. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_44"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1287\/moor.2021.1173","volume":"47","author":"J Correa","year":"2022","unstructured":"Correa, J., Cristi, A., Oosterwijk, T.: On the price of anarchy for flows over time. Math. Oper. Res. 47(2), 1394\u20131411 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1173","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004). https:\/\/doi.org\/10.1287\/moor.1040.0098","journal-title":"Math. Oper. Res."},{"issue":"3\u20135","key":"9_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3\u20135), 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford Jr","year":"1958","unstructured":"Ford, L.R., Jr., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Han, K., Friesz, T.L., Yao, T.: Existence of simultaneous route and departure choice dynamic user equilibrium. Transport. Res. Part B: Methodol. 53, 17\u201330 (2013). https:\/\/doi.org\/10.1016\/j.trb.2013.01.009","DOI":"10.1016\/j.trb.2013.01.009"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3184137","volume":"6","author":"T Harks","year":"2018","unstructured":"Harks, T., Peis, B., Schmand, D., Tauer, B., Vargas Koch, L.: Competitive packet routing with priority lists. ACM Trans. Econ. Comput. (TEAC) 6(1), 1\u201326 (2018). https:\/\/doi.org\/10.1145\/3184137","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"39","key":"9_CR11","doi-asserted-by":"publisher","first-page":"5420","DOI":"10.1016\/j.tcs.2011.05.055","volume":"412","author":"M Hoefer","year":"2011","unstructured":"Hoefer, M., Mirrokni, V.S., R\u00f6glin, H., Teng, S.H.: Competitive routing over time. Theor. Comput. Sci. 412(39), 5420\u20135432 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.055","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-010-9299-y","volume":"49","author":"R Koch","year":"2011","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory Comput. Syst. 49(1), 71\u201397 (2011)","journal-title":"Theory Comput. Syst."},{"key":"9_CR13","volume-title":"The Economics of Welfare","author":"A Pigou","year":"1920","unstructured":"Pigou, A.: The Economics of Welfare. Macmillan, New York (1920)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3(1), 53\u201359 (1973). https:\/\/doi.org\/10.1002\/net.3230030104","journal-title":"Networks"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and The Price of Anarchy. MIT press, Cambridge (2005)","DOI":"10.21236\/ADA637949"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/OPRE.2017.1683","volume":"66","author":"M Scarsini","year":"2018","unstructured":"Scarsini, M., Schr\u00f6der, M., Tomala, T.: Dynamic atomic congestion games with seasonal flows. Oper. Res. 66(2), 327\u2013339 (2018). https:\/\/doi.org\/10.1287\/OPRE.2017.1683","journal-title":"Oper. Res."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3488268","volume":"10","author":"R Scheffler","year":"2022","unstructured":"Scheffler, R., Strehler, M., Vargas Koch, L.: Routing games with edge priorities. ACM Trans. Econ. Comput. 10(1), 1\u201327 (2022). https:\/\/doi.org\/10.1145\/3488268","journal-title":"ACM Trans. Econ. Comput."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Schmand, D., Sch\u00fcrenberg, T., Strehler, M.: On the price of anarchy in packet routing games with FIFO (2025). https:\/\/doi.org\/10.48550\/arXiv.2502.04811","DOI":"10.48550\/arXiv.2502.04811"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Skutella, M.: An Introduction to Network Flows over Time. In: Cook, W.J., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21","DOI":"10.1007\/978-3-540-76796-1_21"},{"issue":"2","key":"9_CR20","first-page":"251","volume":"59","author":"WS Vickrey","year":"1969","unstructured":"Vickrey, W.S.: Congestion theory and transport investment. Am. Econ. Rev. 59(2), 251\u2013260 (1969)","journal-title":"Am. Econ. Rev."},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Werth, T., Holzhauser, M., Krumke, S.: Atomic routing in a deterministic queuing model. Oper. Res. Perspect. 1(1), 18\u201341 (2014). https:\/\/doi.org\/10.1016\/j.orp.2014.05.001","DOI":"10.1016\/j.orp.2014.05.001"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:19Z","timestamp":1747468039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}