{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:20Z","timestamp":1725538700861},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_29","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"323-334","source":"Crossref","is-referenced-by-count":20,"title":["Nash Equilibria and the Price of Anarchy for Flows over Time"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Koch","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a034(6), 515\u2013531 (2000)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","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. Transportation Science\u00a035(4), 389\u2013404 (2001)","journal-title":"Transportation Science"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","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. Transportation Science\u00a037(2), 123\u2013138 (2003)","journal-title":"Transportation Science"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","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. LNCS. Springer, Heidelberg (2009)"},{"issue":"1\u20134","key":"29_CR5","doi-asserted-by":"publisher","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. Annals of Operations Research\u00a020(1\u20134), 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"key":"29_CR6","doi-asserted-by":"crossref","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, ch. III. Information Science Reference (2009)","DOI":"10.4018\/978-1-60566-226-8.ch003"},{"key":"29_CR7","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":"29_CR8","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\u00a012, 258\u2013268 (1968) (in German)","journal-title":"Unternehmensforschung 12"},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","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. Networks and Spatial Economics\u00a04(3), 257\u2013268 (2004)","journal-title":"Networks and Spatial Economics"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","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. Networks and Spatial Economics\u00a04(4), 379\u2013402 (2004)","journal-title":"Networks and Spatial Economics"},{"key":"29_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":"29_CR12","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a032(3), 219\u2013234 (1998)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","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. Transportation Science\u00a017(4), 430\u2013453 (1983)","journal-title":"Transportation Science"},{"issue":"3-5","key":"29_CR14","doi-asserted-by":"publisher","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. Operations Research Letters\u00a023(3-5), 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","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. Operations Research\u00a06(3), 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"29_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":"29_CR17","doi-asserted-by":"publisher","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. Operations Research\u00a041(1), 179\u2013191 (1993)","journal-title":"Operations Research"},{"issue":"6","key":"29_CR18","doi-asserted-by":"publisher","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. Operations Research\u00a037(6), 893\u2013901 (1989)","journal-title":"Operations Research"},{"key":"29_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":"29_CR20","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a040(1), 16\u201334 (2006)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","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. Transportation Science\u00a015(1), 62\u201377 (1981)","journal-title":"Transportation Science"},{"key":"29_CR22","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Technical Report 014-2009, TU Berlin (2009), http:\/\/www.math.tu-berlin.de\/coga\/publications\/techreports\/2009\/Report-%014-2009.xhtml"},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0965-8564(98)00072-X","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? Transportation Research Part A: Policy and Practice\u00a034(2), 137\u2013144 (2000)","journal-title":"Transportation Research Part A: Policy and Practice"},{"issue":"4","key":"29_CR24","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1287\/trsc.18.4.362","volume":"18","author":"H. Mahmassani","year":"1984","unstructured":"Mahmassani, H., Herman, R.: Dynamic user equilibrium departure time and route choice on idealized traffic arterials. Transportation Science\u00a018(4), 362\u2013384 (1984)","journal-title":"Transportation Science"},{"key":"29_CR25","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":"29_CR26","unstructured":"Mahmassani, H.S., Sbayti, H.A., Zhou, X.: DYNASMART-P Version 1.0 Users Guide. Maryland Transportation Initiative, College Park, Maryland (2004)"},{"issue":"9","key":"29_CR27","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a040(9), 779\u2013791 (2006)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"29_CR28","doi-asserted-by":"publisher","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. Transportation Science\u00a041(3), 409\u2013414 (2007)","journal-title":"Transportation Science"},{"key":"29_CR29","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":"3\u20134","key":"29_CR30","doi-asserted-by":"publisher","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. Networks and Spatial Economics\u00a01(3\u20134), 233\u2013265 (2001)","journal-title":"Networks and Spatial Economics"},{"key":"29_CR31","series-title":"Handbooks in Operations Research and Management Science, ch. 3","doi-asserted-by":"publisher","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, ch. 3, vol.\u00a08, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"29_CR32","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":"29_CR33","doi-asserted-by":"publisher","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. Operations Research\u00a041(1), 192\u2013202 (1993)","journal-title":"Operations Research"},{"issue":"1","key":"29_CR34","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a030(1), 31\u201346 (1996)","journal-title":"Transportation Research Part B: Methodological"},{"key":"29_CR35","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":"29_CR36","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"29_CR37","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization, ch. 21","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, ch. 21, pp. 451\u2013482. Springer, Berlin (2009)"},{"issue":"4","key":"29_CR38","doi-asserted-by":"publisher","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. Transportation Science\u00a018(4), 385\u2013394 (1984)","journal-title":"Transportation Science"},{"issue":"1","key":"29_CR39","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a027(1), 49\u201363 (1993)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"7","key":"29_CR40","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.trb.2003.05.001","volume":"38","author":"W.Y. Szeto","year":"2004","unstructured":"Szeto, W.Y., Lo, H.K.: A cell-based simultaneous route and departure time choice model with elastic demand. Transportation Research Part B: Methodological\u00a038(7), 593\u2013612 (2004)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"29_CR41","doi-asserted-by":"publisher","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. Networks and Spatial Economics\u00a03(3), 297\u2013322 (2003)","journal-title":"Networks and Spatial Economics"},{"issue":"2","key":"29_CR42","first-page":"251","volume":"59","author":"W.S. Vickrey","year":"1969","unstructured":"Vickrey, W.S.: Congestion theory and transport investment. The American Economic Review\u00a059(2), 251\u2013260 (1969)","journal-title":"The American Economic Review"},{"issue":"3","key":"29_CR43","doi-asserted-by":"publisher","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. Transportation Research Part B: Methodological\u00a032(3), 173\u2013187 (1998)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"29_CR44","doi-asserted-by":"publisher","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. Transportation Science\u00a033(4), 341\u2013353 (1999)","journal-title":"Transportation Science"},{"issue":"3","key":"29_CR45","doi-asserted-by":"publisher","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. Transportation Research\u00a05(3), 179\u2013196 (1971)","journal-title":"Transportation Research"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:06Z","timestamp":1606185786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}