{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:00:45Z","timestamp":1742936445721,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_16","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"188-201","source":"Crossref","is-referenced-by-count":2,"title":["Resolving Braess\u2019s Paradox in Random Networks"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"given":"Alexis C.","family":"Kaporis","sequence":"additional","affiliation":[]},{"given":"Thanasis","family":"Lianeas","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0024-3795(94)90357-3","volume":"99","author":"I. Alth\u00f6fer","year":"1994","unstructured":"Alth\u00f6fer, I.: On Sparse Approximations to Randomized Strategies and Convex Combinations. Linear Algebra and Applications\u00a099, 339\u2013355 (1994)","journal-title":"Linear Algebra and Applications"},{"key":"16_CR2","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol.\u00a073. Cambridge University Press (2001)"},{"key":"16_CR3","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein paradox aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-17572-5_16","volume-title":"Internet and Network Economics","author":"F. Chung","year":"2010","unstructured":"Chung, F., Young, S.J.: Braess\u2019s paradox in large sparse graphs. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 194\u2013208. Springer, Heidelberg (2010)"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/rsa.20457","volume":"41","author":"F. Chung","year":"2012","unstructured":"Chung, F., Young, S.J., Zhao, W.: Braess\u2019s paradox in expanders. Random Structures and Algorithms\u00a041(4), 451\u2013468 (2012)","journal-title":"Random Structures and Algorithms"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.04.033","volume":"448","author":"D. Fotakis","year":"2012","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Efficient methods for selfish network design. Theoretical Computer Science\u00a0448, 9\u201320 (2012)","journal-title":"Theoretical Computer Science"},{"key":"16_CR7","unstructured":"Kelly, F.: The mathematics of traffic in networks. In: Gowers, T., Green, J., Leader, I. (eds.) The Princeton Companion to Mathematics. Princeton University Press (2008)"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/090769600","volume":"25","author":"H.C. Lin","year":"2011","unstructured":"Lin, H.C., Roughgarden, T., Tardos, \u00c9., Walkover, A.: Stronger bounds on Braess\u2019s paradox and the maximum latency of selfish routing. SIAM Journal on Discrete Mathematics\u00a025(4), 1667\u20131686 (2011)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing Large Games Using Simple Strategies. In: Proc. of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Young, N.E.: Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory. In: Proc. of the 26th ACM Symposium on Theory of Computing (STOC 1994), pp. 734\u2013740 (1994)","DOI":"10.1145\/195058.195447"},{"key":"16_CR11","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, 321\u2013346 (2006)","journal-title":"Games and Economic Behavior"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/trsc.1050.0126","volume":"39","author":"A. Nagurney","year":"2005","unstructured":"Nagurney, A., Boyce, D.: Preface to \u201cOn a Paradox of Traffic Planning\u201d. Transportation Science\u00a039(4), 443\u2013445 (2005)","journal-title":"Transportation Science"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0191-2615(96)00024-0","volume":"31","author":"E.I. Pas","year":"1997","unstructured":"Pas, E.I., Principio, S.L.: Braess\u2019s paradox: Some new insights. Transportation Research Part B\u00a031(3), 265\u2013276 (1997)","journal-title":"Transportation Research Part B"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"issue":"5","key":"16_CR15","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 of Computer and System Sciences\u00a072(5), 922\u2013953 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1287\/trsc.17.3.301","volume":"17","author":"R. Steinberg","year":"1983","unstructured":"Steinberg, R., Zangwill, W.I.: The prevalence of Braess\u2019 paradox. Transportation Science\u00a017(3), 301\u2013318 (1983)","journal-title":"Transportation Science"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/rsa.20325","volume":"37","author":"G. Valiant","year":"2010","unstructured":"Valiant, G., Roughgarden, T.: Braess\u2019s paradox in large random graphs. Random Structures and Algorithms\u00a037(4), 495\u2013515 (2010)","journal-title":"Random Structures and Algorithms"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"V\u00e9gh, L.A.: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. In: Proc. of the 44th ACM Symposium on Theory of Computing (STOC 2012), pp. 27\u201340 (2012)","DOI":"10.1145\/2213977.2213981"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:52:59Z","timestamp":1676843579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}