{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:25Z","timestamp":1725861505358},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_3","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"27-38","source":"Crossref","is-referenced-by-count":2,"title":["Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"3_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":"3_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"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-662-48433-3_17","volume-title":"Algorithmic Game Theory","author":"X Chen","year":"2015","unstructured":"Chen, X., Chen, Z., Hu, X.: Excluding braess\u2019s paradox in nonatomic selfish routing. In: Hoefer, M., et al. (eds.) SAGT 2015. LNCS, vol. 9347, pp. 219\u2013230. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48433-3_17"},{"issue":"1","key":"3_CR4","doi-asserted-by":"crossref","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. Games Econ. Behav. 66(1), 115\u2013125 (2009)","journal-title":"Games Econ. Behav."},{"issue":"1\u20132","key":"3_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman, R., yone (Lev-tov), N.L.: Strong equilibrium in congestion games. Games Econ. Behav 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games Econ. Behav"},{"issue":"2","key":"3_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R Holzman","year":"2003","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)","journal-title":"Math. Soc. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/s00182-014-0448-4","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, 647\u2013666 (2014)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"3_CR8","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 and Econ. Behav. 57(2), 321\u2013346 (2006)","journal-title":"Games and Econ. Behav."},{"issue":"2","key":"3_CR9","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":"3_CR10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:09Z","timestamp":1498329849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}