{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:05:42Z","timestamp":1743091542251,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_23","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:07:44Z","timestamp":1286971664000},"page":"262-275","source":"Crossref","is-referenced-by-count":7,"title":["Braess\u2019s Paradox for Flows over Time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Macko","sequence":"first","affiliation":[]},{"given":"Kate","family":"Larson","sequence":"additional","affiliation":[]},{"given":"\u013dubo\u0161","family":"Steskal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","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":"23_CR2","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: Uber ein paradoxon aus der verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968); English translation in [3]","journal-title":"Unternehmensforschung"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1287\/trsc.1050.0127","volume":"39","author":"D. Braess","year":"2005","unstructured":"Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transportation Science\u00a039(4), 446\u2013450 (2005)","journal-title":"Transportation Science"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R.J. Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Applications\u00a010, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Applications"},{"issue":"3","key":"23_CR5","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":"23_CR6","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)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A.B. Haurie","year":"1985","unstructured":"Haurie, A.B., Marcotte, P.: On the relationship between nash-cournot and wardrop equilibria. Networks\u00a015, 295\u2013308 (1985)","journal-title":"Networks"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kameda, H.: How harmful the paradox can be in the Braess\/Cohen-Kelly-Jeffries networks. In: IEEE INFOCOM, vol.\u00a01, pp. 437\u2013445 (2002)","DOI":"10.1109\/INFCOM.2002.1019286"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. In: Algorithmic Game Theory, pp. 323\u2013334 (2009)","DOI":"10.1007\/978-3-642-04645-2_29"},{"key":"23_CR10","first-page":"340","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004)","author":"H. Lin","year":"2004","unstructured":"Lin, H., Roughgarden, T., Tardos, \u00c9.: A stronger bound on braess\u2019s paradox. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 340\u2013341. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"23_CR11","unstructured":"Macko, M.: The Price of Anarchy in Network Congestion Games. PhD thesis, Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava, Slovakia (2010)"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I. Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games and Economic Behavior\u00a057(2), 321\u2013346 (2006)","journal-title":"Games and Economic Behavior"},{"issue":"3-4","key":"23_CR13","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-4), 233\u2013265 (2001)","journal-title":"Networks and Spatial Economics"},{"issue":"5","key":"23_CR14","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of braess\u2019s paradox: designing networks for selfish users is hard. Journal Computer System Sciences\u00a072(5), 922\u2013953 (2006)","journal-title":"Journal Computer System Sciences"},{"key":"23_CR15","first-page":"1","volume":"74","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. Optima Mathematical Programming Society Newsletter\u00a074, 1\u201314 (2006)","journal-title":"Optima Mathematical Programming Society Newsletter"},{"issue":"2","key":"23_CR16","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"},{"issue":"2","key":"23_CR17","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"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"},{"issue":"3","key":"23_CR19","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-16170-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:16:56Z","timestamp":1740593816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}