{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:47:02Z","timestamp":1772776022142,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Training Group UnRAVeL","award":["2236"],"award-info":[{"award-number":["2236"]}]},{"name":"Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)","award":["EXC-2046\/1, project ID 390685689"],"award-info":[{"award-number":["EXC-2046\/1, project ID 390685689"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467626","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"797-816","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Convergence of a Packet Routing Model to Flows Over Time"],"prefix":"10.1145","author":[{"given":"Leon","family":"Sering","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}]},{"given":"Laura","family":"Vargas Koch","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Theresa","family":"Ziemke","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-014-0073-1"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation, EC. Association for Computing Machinery","author":"Cao Z.","unstructured":"Z. Cao , B. Chen , X. Chen , and C. Wang . 2017. A network game of dynamic traffic . In Proceedings of the 2017 ACM Conference on Economics and Computation, EC. Association for Computing Machinery , New York, NY, USA, 695--696. Z. Cao, B. Chen, X. Chen, and C. Wang. 2017. A network game of dynamic traffic. In Proceedings of the 2017 ACM Conference on Economics and Computation, EC. Association for Computing Machinery, New York, NY, USA, 695--696."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R. Cominetti J. Correa and O. Larr\u00e9. 2011. Existence and uniqueness of equilibria for flows over time. In International Colloquium on Automata Languages and Programming ICALP. Springer-Verlag Zurich Switzerland 552--563.  R. Cominetti J. Correa and O. Larr\u00e9. 2011. Existence and uniqueness of equilibria for flows over time. In International Colloquium on Automata Languages and Programming ICALP. Springer-Verlag Zurich Switzerland 552--563.","DOI":"10.1007\/978-3-642-22012-8_44"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3202838.3202841"},{"key":"e_1_3_2_1_5_1","volume-title":"Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. In International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer","author":"Cominetti R.","unstructured":"R. Cominetti , J. Correa , and N. Olver . 2017 . Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. In International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer , Waterloo, Canada, 161--172. R. Cominetti, J. Correa, and N. Olver. 2017. Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. In International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer, Waterloo, Canada, 161--172."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R. Cominetti M. Scarsini M. Schr\u00f6der and N. Stier-Moses. 2021. Approximation and Convergence of Large Atomic Congestion Games. arxiv: cs.GT\/2001.02797  R. Cominetti M. Scarsini M. Schr\u00f6der and N. Stier-Moses. 2021. Approximation and Convergence of Large Atomic Congestion Games. arxiv: cs.GT\/2001.02797","DOI":"10.1287\/moor.2022.1281"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 2019 ACM Conference on Economics and Computation, EC. ACM","author":"Correa J.","unstructured":"J. Correa , A. Cristi , and T. Oosterwijk . 2019. On the price of anarchy for flows over time . In Proceedings of the 2019 ACM Conference on Economics and Computation, EC. ACM , Phoenix, Arizona, USA, 559--577. J. Correa, A. Cristi, and T. Oosterwijk. 2019. On the price of anarchy for flows over time. In Proceedings of the 2019 ACM Conference on Economics and Computation, EC. ACM, Phoenix, Arizona, USA, 559--577."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00037-6"},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer","author":"Frascaria D.","unstructured":"D. Frascaria and N. Olver . 2020. Algorithms for flows over time with scheduling costs . In International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer , London, UK, 130--143. D. Frascaria and N. Olver. 2020. Algorithms for flows over time with scheduling costs. In International Conference on Integer Programming and Combinatorial Optimization, IPCO. Springer, London, UK, 130--143."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01504-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184137"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.055"},{"key":"e_1_3_2_1_13_1","unstructured":"A. Horni K. Nagel and K. Axhausen (Eds.). 2016. Multi-agent transport simulation MATSim .Ubiquity Press London UK.  A. Horni K. Nagel and K. Axhausen (Eds.). 2016. Multi-agent transport simulation MATSim .Ubiquity Press London UK."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71924-5_19"},{"key":"e_1_3_2_1_15_1","volume-title":"International Symposium on Algorithmic Game Theory, SAGT. Springer","author":"Israel J.","unstructured":"J. Israel and L. Sering . 2020. The impact of spillback on the price of anarchy for flows over time . In International Symposium on Algorithmic Game Theory, SAGT. Springer , Springer, Augsburg, Germany, 114--129. J. Israel and L. Sering. 2020. The impact of spillback on the price of anarchy for flows over time. In International Symposium on Algorithmic Game Theory, SAGT. Springer, Springer, Augsburg, Germany, 114--129."},{"key":"e_1_3_2_1_16_1","unstructured":"M. Kaiser. 2020. Computation of Dynamic Equilibria in Series-Parallel Networks. arxiv: cs.GT\/2002.11428  M. Kaiser. 2020. Computation of Dynamic Equilibria in Series-Parallel Networks. arxiv: cs.GT\/2002.11428"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9299-y"},{"key":"e_1_3_2_1_18_1","volume-title":"Equilibrium results for dynamic congestion games. Transportation science","author":"Meunier Fr\u00e9d\u00e9ric","year":"2010","unstructured":"Fr\u00e9d\u00e9ric Meunier and Nicolas Wagner . 2010. Equilibrium results for dynamic congestion games. Transportation science , Vol. 44 , 4 ( 2010 ), 524--536. Fr\u00e9d\u00e9ric Meunier and Nicolas Wagner. 2010. Equilibrium results for dynamic congestion games. Transportation science, Vol. 44, 4 (2010), 524--536."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2008.04.002"},{"key":"e_1_3_2_1_20_1","volume-title":"International Symposium on Algorithmic Game Theory, SAGT. Springer","author":"Pham H.M.","unstructured":"H.M. Pham and L. Sering . 2020. Dynamic equilibria in time-varying networks . In International Symposium on Algorithmic Game Theory, SAGT. Springer , Springer, Augsburg, Germany, 130--145. H.M. Pham and L. Sering. 2020. Dynamic equilibria in time-varying networks. In International Symposium on Algorithmic Game Theory, SAGT. Springer, Springer, Augsburg, Germany, 130--145."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030104"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1683"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"R. Scheffler M. Strehler and L. Vargas Koch. 2018. Nash equilibria in routing games with edge priorities. arxiv: cs.GT\/1803.00865  R. Scheffler M. Strehler and L. Vargas Koch. 2018. Nash equilibria in routing games with edge priorities. arxiv: cs.GT\/1803.00865","DOI":"10.1007\/978-3-030-04612-5_27"},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"Multi-source multi-sink Nash flows over time. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS, Vol. 65. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, Helsinki","volume":"12","author":"Sering L.","year":"2018","unstructured":"L. Sering and M. Skutella . 2018 . Multi-source multi-sink Nash flows over time. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS, Vol. 65. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, Helsinki , Finland , 12 : 1 -- 12 :20. L. Sering and M. Skutella. 2018. Multi-source multi-sink Nash flows over time. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS, Vol. 65. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, Helsinki, Finland, 12:1--12:20.","journal-title":"Finland"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM","author":"Sering L.","unstructured":"L. Sering and L. Vargas Koch . 2019. Nash flows over time with spillback . In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM , San Diego, California, USA, 935--945. L. Sering and L. Vargas Koch. 2019. Nash flows over time with spillback. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, San Diego, California, USA, 935--945."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11259"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2014.05.001"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2021.01.014"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467626","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":28,"alternative-id":["10.1145\/3465456.3467626","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467626","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}