{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:43:04Z","timestamp":1772775784164,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,16]],"date-time":"2010-11-16T00:00:00Z","timestamp":1289865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00224-010-9299-y","type":"journal-article","created":{"date-parts":[[2010,11,15]],"date-time":"2010-11-15T12:47:45Z","timestamp":1289825265000},"page":"71-97","source":"Crossref","is-referenced-by-count":60,"title":["Nash Equilibria and the Price of Anarchy for Flows over Time"],"prefix":"10.1007","volume":"49","author":[{"given":"Ronald","family":"Koch","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,16]]},"reference":[{"issue":"6","key":"9299_CR1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0191-2615(99)00036-3","volume":"34","author":"T. Akamatsu","year":"2000","unstructured":"Akamatsu, T.: A dynamic traffic equilibrium assignment paradox. Transp. Res. B 34(6), 515\u2013531 (2000)","journal-title":"Transp. Res. B"},{"issue":"4","key":"9299_CR2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/trsc.35.4.389.10435","volume":"35","author":"T. Akamatsu","year":"2001","unstructured":"Akamatsu, T.: An efficient algorithm for dynamic traffic equilibrium assignment with queues. Transp. Sci. 35(4), 389\u2013404 (2001)","journal-title":"Transp. Sci."},{"issue":"2","key":"9299_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/trsc.37.2.123.15245","volume":"37","author":"T. Akamatsu","year":"2003","unstructured":"Akamatsu, T., Heydecker, B.: Detecting dynamic traffic assignment capacity paradoxes in saturated networks. Transp. Sci. 37(2), 123\u2013138 (2003)","journal-title":"Transp. Sci."},{"key":"9299_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-04645-2_16","volume-title":"Proceedings of the 2nd International Symposium on Algorithmic Game Theory","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Ukkusuri, S.: Equilibria in dynamic selfish routing. In: Mavronicolas, M. (ed.) Proceedings of the 2nd International Symposium on Algorithmic Game Theory. Lecture Notes in Computer Science, vol. 5814, pp. 171\u2013182. Springer, Berlin (2009)"},{"issue":"1\u20134","key":"9299_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20(1\u20134), 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"9299_CR6","volume-title":"Multi-Agent Systems for Traffic and Transportation Engineering","author":"M. Balmer","year":"2009","unstructured":"Balmer, M., Rieser, M., Meister, K., Charypar, D., Lefebvre, N., Nagel, K.: MATSim-T: Architecture and simulation times. In: Bazzan, A., Kl\u00fcgl, F. (eds.) Multi-Agent Systems for Traffic and Transportation Engineering. Information Science Reference, Hershey (2009)"},{"key":"9299_CR7","volume-title":"Proceedings of the 3rd Triennial Symposium on Transportation Systems","author":"M.J. Ben-Akiva","year":"1998","unstructured":"Ben-Akiva, M.J., Bierlaire, M., Koutsopoulos, H.N., Mishalani, R.: Dynamit: a simulation-based system for traffic prediction and guidance generation. In: Proceedings of the 3rd Triennial Symposium on Transportation Systems (1998)"},{"key":"9299_CR8","doi-asserted-by":"crossref","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 12, 258\u2013268 (1968). In German","journal-title":"Unternehmensforschung 12"},{"issue":"3","key":"9299_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/B:NETS.0000039782.48154.ef","volume":"4","author":"M. Carey","year":"2004","unstructured":"Carey, M.: Link travel times I: Properties derived from traffic-flow models. Netw. Spat. Econ. 4(3), 257\u2013268 (2004)","journal-title":"Netw. Spat. Econ."},{"issue":"4","key":"9299_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/B:NETS.0000047114.31259.3d","volume":"4","author":"M. Carey","year":"2004","unstructured":"Carey, M.: Link travel times II: Properties derived from traffic-flow models. Netw. Spat. Econ. 4(4), 379\u2013402 (2004)","journal-title":"Netw. Spat. Econ."},{"key":"9299_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59980-4","volume-title":"Dynamic Travel Choice Models: A Variational Inequality Approach","author":"H.-K. Chen","year":"1999","unstructured":"Chen, H.-K.: Dynamic Travel Choice Models: A Variational Inequality Approach. Springer, Berlin (1999)"},{"issue":"3","key":"9299_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0191-2615(97)00026-X","volume":"32","author":"H.-K. Chen","year":"1998","unstructured":"Chen, H.-K., Hsueh, C.-F.: A model and an algorithm for the dynamic user-optimal route choice problem. Transp. Res. B 32(3), 219\u2013234 (1998)","journal-title":"Transp. Res. B"},{"issue":"1","key":"9299_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.32.1.3","volume":"32","author":"C.F. Daganzo","year":"1998","unstructured":"Daganzo, C.F.: Queue spillovers in transportation networks with a route choice. Transp. Sci. 32(1), 3\u201311 (1998)","journal-title":"Transp. Sci."},{"issue":"3\u20135","key":"9299_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L.K. Fleischer","year":"1998","unstructured":"Fleischer, L.K., 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":"9299_CR15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"9299_CR16","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"1","key":"9299_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.41.1.179","volume":"41","author":"T.L. Friesz","year":"1993","unstructured":"Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., Wie, B.W.: A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1), 179\u2013191 (1993)","journal-title":"Oper. Res."},{"issue":"6","key":"9299_CR18","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1287\/opre.37.6.893","volume":"37","author":"T.L. Friesz","year":"1989","unstructured":"Friesz, T.L., Luque, J., Tobin, R.L., Wie, B.W.: Dynamic network traffic assignment considered as a continuous time optimal control problem. Oper. Res. 37(6), 893\u2013901 (1989)","journal-title":"Oper. Res."},{"key":"9299_CR19","first-page":"227","volume-title":"Pedestrian and Evacuation Dynamics","author":"H.W. Hamacher","year":"2002","unstructured":"Hamacher, H.W., Tjandra, S.A.: Mathematical modelling of evacuation problems: a state of the art. In: Schreckenberg, M., Sharma, S.D. (eds.) Pedestrian and Evacuation Dynamics, pp. 227\u2013266. Springer, Berlin (2002)"},{"issue":"1","key":"9299_CR20","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.trb.2005.01.002","volume":"40","author":"S. Han","year":"2006","unstructured":"Han, S., Heydecker, B.G.: Consistent objectives and solution of dynamic user equilibrium models. Transp. Res. B 40(1), 16\u201334 (2006)","journal-title":"Transp. Res. B"},{"issue":"1","key":"9299_CR21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/trsc.15.1.62","volume":"15","author":"C. Hendrickson","year":"1981","unstructured":"Hendrickson, C., Kocur, G.: Schedule delay and departure time decisions in a deterministic model. Transp. Sci. 15(1), 62\u201377 (1981)","journal-title":"Transp. Sci."},{"key":"9299_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-642-10841-9_4","volume-title":"Proceedings of the 5th International Workshop on Internet and Network Economics","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M., Mirrokni, V., R\u00f6glin, H., Teng, S.-H.: Competitive routing over time. In: Leonardi, S. (ed.) Proceedings of the 5th International Workshop on Internet and Network Economics. Lecture Notes in Computer Science, vol. 5929, pp. 18\u201329. Springer, Berlin (2009)"},{"key":"9299_CR23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"J.J. Jarvis","year":"1982","unstructured":"Jarvis, J.J., Ratliff, H.D.: Some equivalent objectives for dynamic network flow problems. Manag. Sci. 28, 106\u2013108 (1982)","journal-title":"Manag. Sci."},{"key":"9299_CR24","unstructured":"Koch, R.: PhD thesis, TU Berlin. In preparation"},{"key":"9299_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-642-04645-2_29","volume-title":"Proceedings of the 2nd International Symposium on Algorithmic Game","author":"R. Koch","year":"2009","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. In: Mavronicolas, M. (ed.) Proceedings of the 2nd International Symposium on Algorithmic Game. Lecture Notes in Computer Science, vol. 5814, pp. 323\u2013334. Springer, Berlin (2009)"},{"key":"9299_CR26","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1137\/S1052623403432645","volume":"15","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. SIAM J. Optim. 15, 1185\u20131202 (2005)","journal-title":"SIAM J. Optim."},{"key":"9299_CR27","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)","edition":"4"},{"issue":"2","key":"9299_CR28","first-page":"137","volume":"34","author":"W.H. Lin","year":"2000","unstructured":"Lin, W.H., Lo, H.K.: Are the objective and solutions of dynamic user-equilibrium models always consistent? Transp. Res. A 34(2), 137\u2013144 (2000)","journal-title":"Transp. Res. A"},{"issue":"4","key":"9299_CR29","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/trsc.18.4.362","volume":"18","author":"H.S. Mahmassani","year":"1984","unstructured":"Mahmassani, H.S., Herman, R.: Dynamic user equilibrium departure time and route choice on idealized traffic arterials. Transp. Sci. 18(4), 362\u2013384 (1984)","journal-title":"Transp. Sci."},{"key":"9299_CR30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-79641-8_1","volume-title":"Urban Traffic Networks. Dynamic Flow Modelling and Control","author":"H.S. Mahmassani","year":"1995","unstructured":"Mahmassani, H.S., Peeta, S.: System optimal dynamic assignment for electronic route guidance in a congested traffic network. In: Gartner, N.H., Improta, G. (eds.) Urban Traffic Networks. Dynamic Flow Modelling and Control, pp. 3\u201337. Springer, Berlin (1995)"},{"key":"9299_CR31","volume-title":"DYNASMART-P Version 1.0 User\u2019s Guide","author":"H.S. Mahmassani","year":"2004","unstructured":"Mahmassani, H.S., Sbayti, H.A., Zhou, X.: DYNASMART-P Version 1.0 User\u2019s Guide. Maryland Transportation Initiative, College Park (2004)"},{"issue":"9","key":"9299_CR32","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/j.trb.2005.10.004","volume":"40","author":"R. Mounce","year":"2006","unstructured":"Mounce, R.: Convergence in a continuous dynamic queueing model for traffic networks. Transp. Res. B 40(9), 779\u2013791 (2006)","journal-title":"Transp. Res. B"},{"issue":"3","key":"9299_CR33","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1287\/trsc.1070.0202","volume":"41","author":"R. Mounce","year":"2007","unstructured":"Mounce, R.: Convergence to equilibrium in dynamic traffic networks when route cost is decay monotone. Transp. Sci. 41(3), 409\u2013414 (2007)","journal-title":"Transp. Sci."},{"key":"9299_CR34","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"4","key":"9299_CR35","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/trsc.17.4.430","volume":"17","author":"A. Palma de","year":"1983","unstructured":"de Palma, A., Ben-Akiva, M., Lef\u00e8vre, C., Litinas, N.: Stochastic equilibrium model of peak period traffic congestion. Transp. Sci. 17(4), 430\u2013453 (1983)","journal-title":"Transp. Sci."},{"issue":"3\u20134","key":"9299_CR36","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1012827724856","volume":"1","author":"S. Peeta","year":"2001","unstructured":"Peeta, S., Ziliaskopoulos, A.K.: Foundations of dynamic traffic assignment: the past, the present and the future. Netw. Spat. Econ. 1(3\u20134), 233\u2013265 (2001)","journal-title":"Netw. Spat. Econ."},{"key":"9299_CR37","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing","author":"W.B. Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"9299_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modelling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran, B., Boyce, D.E.: Modelling Dynamic Transportation Networks. Springer, Berlin (1996)"},{"issue":"1","key":"9299_CR39","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.41.1.192","volume":"41","author":"B. Ran","year":"1993","unstructured":"Ran, B., Boyce, D.E., Leblanc, L.J.: A new class of instantaneous dynamic user-optimal traffic assignment models. Oper. Res. 41(1), 192\u2013202 (1993)","journal-title":"Oper. Res."},{"issue":"1","key":"9299_CR40","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0191-2615(95)00010-0","volume":"30","author":"B. Ran","year":"1996","unstructured":"Ran, B., Hall, R.W., Boyce, D.E.: A link-based variational inequality model for dynamic departure time\/route choice. Transp. Res. B 30(1), 31\u201346 (1996)","journal-title":"Transp. Res. B"},{"key":"9299_CR41","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"9299_CR42","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/SFCS.2000.892069","volume-title":"Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science","author":"T. Roughgarden","year":"2000","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 93\u2013102 (2000)"},{"key":"9299_CR43","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M. Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Berlin (2009)"},{"issue":"4","key":"9299_CR44","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1287\/trsc.18.4.385","volume":"18","author":"M.J. Smith","year":"1984","unstructured":"Smith, M.J.: The existence of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transp. Sci. 18(4), 385\u2013394 (1984)","journal-title":"Transp. Sci."},{"issue":"1","key":"9299_CR45","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0191-2615(93)90011-X","volume":"27","author":"M.J. Smith","year":"1993","unstructured":"Smith, M.J.: A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transp. Res. B 27(1), 49\u201363 (1993)","journal-title":"Transp. Res. B"},{"issue":"7","key":"9299_CR46","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.trb.2003.05.001","volume":"38","author":"W.Y. Szeto","year":"2004","unstructured":"Szeto, W.Y., Lo, Hong K.: A cell-based simultaneous route and departure time choice model with elastic demand. Transp. Res. B 38(7), 593\u2013612 (2004)","journal-title":"Transp. Res. B"},{"issue":"3","key":"9299_CR47","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1025394201651","volume":"3","author":"N.B. Taylor","year":"2003","unstructured":"Taylor, N.B.: The CONTRAM dynamic traffic assignment model. Netw. Spat. Econ. 3(3), 297\u2013322 (2003)","journal-title":"Netw. Spat. Econ."},{"issue":"2","key":"9299_CR48","first-page":"251","volume":"59","author":"W.S. 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."},{"issue":"3","key":"9299_CR49","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0191-2615(97)00023-4","volume":"32","author":"J.H. Wu","year":"1998","unstructured":"Wu, J.H., Chen, Y., Florian, M.: The continuous dynamic network loading problem: a mathematical formulation and solution method. Transp. Res. Part B, Methodol. 32(3), 173\u2013187 (1998)","journal-title":"Transp. Res. Part B, Methodol."},{"issue":"4","key":"9299_CR50","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/trsc.33.4.341","volume":"33","author":"Y.W. Xu","year":"1999","unstructured":"Xu, Y.W., Wu, J.H., Florian, M., Marcotte, P., Zhu, D.L.: Advances in the continuous dynamic network loading problem. Transp. Sci. 33(4), 341\u2013353 (1999)","journal-title":"Transp. Sci."},{"issue":"3","key":"9299_CR51","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0041-1647(71)90020-7","volume":"5","author":"S. Yagar","year":"1971","unstructured":"Yagar, S.: Dynamic traffic assignment by individual path minimization and queuing. Transp. Res. 5(3), 179\u2013196 (1971)","journal-title":"Transp. Res."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9299-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9299-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9299-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:22Z","timestamp":1558698862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9299-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,16]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9299"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9299-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,16]]}}}