{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:47Z","timestamp":1740122387886,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 11531014","Grant No. 11901605"],"award-info":[{"award-number":["Grant No. 11531014","Grant No. 11901605"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Frontier Sciences, CAS","award":["ZDBS-LY-7008"],"award-info":[{"award-number":["ZDBS-LY-7008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00539-7","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T03:02:24Z","timestamp":1581735744000},"page":"1705-1723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On weak Pareto optimality of nonatomic routing networks"],"prefix":"10.1007","volume":"44","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-5960","authenticated-orcid":false,"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"539_CR1","volume-title":"Studies in the economics of transportation","author":"MJ Beckmann","year":"1956","unstructured":"Beckmann MJ, McGuire CB, Winsten CB (1956) Studies in the economics of transportation. Yale University Press, New Haven"},{"issue":"1","key":"539_CR2","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess D (1968) \u00dcber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12(1):258\u2013268","journal-title":"Unternehmensforschung"},{"key":"539_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-42634-1_3","volume-title":"Computing and combinatorics","author":"X Chen","year":"2016","unstructured":"Chen X, Diao Z (2016) Network topologies for weakly pareto optimal nonatomic selfish routing. Computing and combinatorics, vol 9797. Lecture notes in computer science. Springer, Switzerland, pp 27\u201338"},{"issue":"4","key":"539_CR4","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00224-016-9710-4","volume":"59","author":"X Chen","year":"2016","unstructured":"Chen X, Diao Z, Hu X (2016) Network characterizations for excluding braess\u2019s paradox. Theory Comput Syst 59(4):747\u2013780","journal-title":"Theory Comput Syst"},{"issue":"1","key":"539_CR5","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 (2009) Efficient graph topologies in network routing games. Games Econ Behav 66(1):115\u2013125","journal-title":"Games Econ Behav"},{"issue":"3","key":"539_CR6","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00182-014-0448-4","volume":"44","author":"R Holzman","year":"2015","unstructured":"Holzman R, Monderer D (2015) Strong equilibrium in network congestion games: increasing versus decreasing costs. Int J Game Theory 44(3):647\u2013666","journal-title":"Int J Game Theory"},{"issue":"1\u20132","key":"539_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman R, Law-yone N (1997) Strong equilibrium in congestion games. Games Econ Behav 21(1\u20132):85\u2013101","journal-title":"Games Econ Behav"},{"issue":"2","key":"539_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R Holzman","year":"2003","unstructured":"Holzman R, Law-yone N (2003) Network structure and strong equilibrium in route selection games. Math Soc Sci 46(2):193\u2013205","journal-title":"Math Soc Sci"},{"key":"539_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3:65\u201369","journal-title":"Comput Sci Rev"},{"issue":"2","key":"539_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 (2006) Network topology and the efficiency of equilibrium. Games Econ Behav 57(2):321\u2013346","journal-title":"Games Econ Behav"},{"issue":"2","key":"539_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00539-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00539-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00539-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:45:36Z","timestamp":1664354736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00539-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00539-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}