{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:54:51Z","timestamp":1712062491844},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T00:00:00Z","timestamp":1365120000000},"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":[[2013,7]]},"DOI":"10.1007\/s00224-013-9462-3","type":"journal-article","created":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T13:41:39Z","timestamp":1365082899000},"page":"86-106","source":"Crossref","is-referenced-by-count":8,"title":["Braess\u2019s Paradox for Flows over Time"],"prefix":"10.1007","volume":"53","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","published-online":{"date-parts":[[2013,4,5]]},"reference":[{"issue":"2","key":"9462_CR1","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":"9462_CR2","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: Uber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12, 258\u2013268 (1968). English translation in [3]","journal-title":"Unternehmensforschung"},{"issue":"4","key":"9462_CR3","doi-asserted-by":"crossref","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. Transp. Sci. 39(4), 446\u2013450 (2005)","journal-title":"Transp. Sci."},{"key":"9462_CR4","doi-asserted-by":"crossref","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. Appl. 10, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"9462_CR5","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":"9462_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":"9462_CR7","doi-asserted-by":"crossref","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 15, 295\u2013308 (1985)","journal-title":"Networks"},{"key":"9462_CR8","first-page":"437","volume-title":"IEEE INFOCOM","author":"H. Kameda","year":"2002","unstructured":"Kameda, H.: How harmful the paradox can be in the Braess\/Cohen-Kelly-Jeffries networks. In: IEEE INFOCOM, vol. 1, pp. 437\u2013445 (2002)"},{"key":"9462_CR9","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Algorithmic Game Theory 323\u2013334 (2009)","DOI":"10.1007\/978-3-642-04645-2_29"},{"key":"9462_CR10","first-page":"340","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201904)","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\u201904), pp. 340\u2013341. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"9462_CR11","unstructured":"Macko, M.: The price of anarchy in network congestion games. Ph.D. thesis, Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava, Slovakia (2010)"},{"issue":"2","key":"9462_CR12","doi-asserted-by":"crossref","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 Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Games Econ. Behav."},{"issue":"3\u20134","key":"9462_CR13","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."},{"issue":"5","key":"9462_CR14","doi-asserted-by":"crossref","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. J.\u00a0Comput. Syst. Sci. 72(5), 922\u2013953 (2006)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9462_CR15","first-page":"1","volume":"74","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. Optima Math. Program. Soc. Newsl. 74, 1\u201314 (2006)","journal-title":"Optima Math. Program. Soc. Newsl."},{"issue":"2","key":"9462_CR16","doi-asserted-by":"crossref","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? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"9462_CR17","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."},{"key":"9462_CR18","first-page":"325","volume-title":"Proceedings of the Institute of Civil Engineers, Pt. II","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325\u2013378 (1952)"},{"issue":"3","key":"9462_CR19","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-013-9462-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9462-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9462-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T20:45:22Z","timestamp":1562877922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9462-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9462"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9462-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,5]]}}}