{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:29:04Z","timestamp":1767979744503,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642046445","type":"print"},{"value":"9783642046452","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_16","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"171-182","source":"Crossref","is-referenced-by-count":18,"title":["Equilibria in Dynamic Selfish Routing"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Ukkusuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Anshelevich, E., Ukkusuri, S.: Equilibria in Dynamic Selfish Routing, http:\/\/www.cs.rpi.edu\/~eanshel"},{"key":"16_CR2","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\u201366 (1989)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"16_CR3","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":"16_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: ACM Conference on Electronic Commerce, ESA (2005)","DOI":"10.1007\/11561071_8"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11786986_46","volume-title":"Automata, Languages and Programming","author":"R. Cominetti","year":"2006","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.: Network games with atomic players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 525\u2013536. Springer, Heidelberg (2006)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research\u00a029(4), 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chicago Journal of Theoretical Computer Science, Article #1 (2008)","DOI":"10.4086\/cjtcs.2008.001"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1287\/opre.37.6.893","volume":"37","author":"T. Friesz","year":"1989","unstructured":"Friesz, T., Luque, J., Tobin, R.L., Wie, B.W.: Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research\u00a037, 893\u2013901 (1989)","journal-title":"Operations Research"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-006-0196-3","volume":"47","author":"A. Hall","year":"2007","unstructured":"Hall, A., Langkau, K., Skutella, M.: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica\u00a047(3), 299\u2013321 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The Quickest Transshipment Problem. Mathematics of Operations Research\u00a025(1), 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M.: Nash Equilibria and the Price of Anarchy for Flows over Time. Matheon Preprint 524 (2008)","DOI":"10.1007\/978-3-642-04645-2_29"},{"key":"16_CR12","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Skutella, M.: Traffic Networks and Flows Over Time. In: Kramer, J. (ed.) DFG Research Center: Mathematics for Key Technologies. Berliner Mathematische Gesellschaft, pp. 49\u201370 (2002)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","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 Journal on Optimization\u00a015(4), 1185\u20131202 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"16_CR14","unstructured":"Fleischer, L., Skutella, M.: Minumum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 66\u201375 (2003)"},{"issue":"3\/4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1012827724856","volume":"1","author":"S. Peeta","year":"2001","unstructured":"Peeta, S., Ziliaskopoulos, A.: Foundations of dynamic traffic assignment: The past, the present, and the future. Networks and Spatial Economics\u00a01(3\/4), 233\u2013266 (2001)","journal-title":"Networks and Spatial Economics"},{"key":"16_CR16","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., Jaille, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhause, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, ch. 3, vol.\u00a08, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"16_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modeling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran, B., Boyce, D.E.: Modeling Dynamic Transportation Networks. Springer, Berlin (1996)"},{"key":"16_CR18","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)"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"16_CR20","unstructured":"Stier-Moses, N.: Selfish versus Coordinated Routing in Network Games. PhD Dissertation, Sloan School of Business, MIT (2004)"},{"key":"16_CR21","unstructured":"Waller, S.T., Ukkusuri, S.: A linear program for the user optimal dynamic traffic assignment problem. In: Review, Transportation Science (2003)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the Institute of Civil Engineers, Part II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"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_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:01Z","timestamp":1606185781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}