{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:00:19Z","timestamp":1760299219262},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662484326"},{"type":"electronic","value":"9783662484333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48433-3_17","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T07:07:03Z","timestamp":1443078423000},"page":"219-230","source":"Crossref","is-referenced-by-count":6,"title":["Excluding Braess\u2019s Paradox in Nonatomic Selfish Routing"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"17_CR1","volume-title":"Studies in the Economics of Transportation","author":"MJ Beckmann","year":"1956","unstructured":"Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"1","key":"17_CR2","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12(1), 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.geb.2008.04.011","volume":"66","author":"A Epstein","year":"2009","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Efficient graph topologies in network routing games. Game. Econ. Behav. 66(1), 115\u2013125 (2009)","journal-title":"Game. Econ. Behav."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2013.11.035","volume":"521","author":"D Fotakis","year":"2014","unstructured":"Fotakis, D., Kaporis, A.C., Lianeas, T., Spirakis, P.G.: On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521, 107\u2013122 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR5","unstructured":"Holzman, R., Yone (Lev-tov), N.L.: Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46(2), 193\u2013205 (2003)"},{"key":"17_CR6","first-page":"1","volume":"44","author":"R Holzman","year":"2014","unstructured":"Holzman, R., Monderer, D.: Strong equilibrium in network congestion games: increasing versus decreasing costs. Int. J. Game Theory 44, 1\u201320 (2014)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/090769600","volume":"25","author":"H Lin","year":"2011","unstructured":"Lin, H., Roughgarden, T., Tardos, \u00c9., Walkover, A.: Stronger bounds on braess\u2019s paradox and the maximum latency of selfish routing. SIAM J. Discrete Math. 25(4), 1667\u20131686 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.1040.0122","volume":"30","author":"I Milchtaich","year":"2005","unstructured":"Milchtaich, I.: Topological conditions for uniqueness of equilibrium in networks. Math. Oper. Res 30(1), 225\u2013244 (2005)","journal-title":"Math. Oper. Res"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11944874_9","volume-title":"Internet and Network Economics","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I.: The equilibrium existence problem in finite network congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 87\u201398. Springer, Heidelberg (2006)"},{"issue":"2","key":"17_CR10","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. Game. Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Game. Econ. Behav."},{"issue":"5","key":"17_CR11","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. J. Compu. Syst. Sci. 72(5), 922\u2013953 (2006)","journal-title":"J. Compu. Syst. Sci."},{"issue":"2","key":"17_CR12","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? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"17_CR13","volume-title":"Graph Theory. Electronic Library of Mathematics","author":"WT Tutte","year":"2004","unstructured":"Tutte, W.T.: Graph Theory. Electronic Library of Mathematics. China Machine Press, Beijing (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48433-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:39:02Z","timestamp":1559252342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48433-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662484326","9783662484333"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48433-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}