{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:59:59Z","timestamp":1649091599218},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11424-011-8156-7","type":"journal-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T11:22:29Z","timestamp":1296732149000},"page":"68-78","source":"Crossref","is-referenced-by-count":0,"title":["A selfish routing based network improvement problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Binwu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,4]]},"reference":[{"key":"8156_CR1","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"M. Beckmann, C. B. Mcguire, and C. B. Winsten, Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956."},{"key":"8156_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. F. Nash","year":"1950","unstructured":"J. F. Nash, Equilibrium points in n-person games, Proceedings of National Academy of Sciences, 1950, 36: 48\u201349.","journal-title":"Proceedings of National Academy of Sciences"},{"key":"8156_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A. Haurieand","year":"1985","unstructured":"A. Haurieand and P. Marcotte, On the relation between Nash-Cournot and Wardrop equilibria, Networks, 1985, 15: 295\u2013308.","journal-title":"Networks"},{"key":"8156_CR4","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. H. Papadimitriou, Worst-case equilibria, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, 1999: 404\u2013413.","DOI":"10.1007\/3-540-49116-3_38"},{"key":"8156_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0041-1647(70)90196-6","volume":"4","author":"J. D. Murchkand","year":"1970","unstructured":"J. D. Murchkand, Braess\u2019s paradox of traffic flow, Transport, Res., 1970, 4: 391\u2013394.","journal-title":"Transport, Res."},{"key":"8156_CR6","doi-asserted-by":"crossref","unstructured":"T. Roughgarden, Designing networks for selfish users is hard, Proceedings of the 42th Annual Symposium on Foundations of Computer Science, 2001: 472\u2013481.","DOI":"10.1109\/SFCS.2001.959923"},{"issue":"2","key":"8156_CR7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"T. Roughgarden and E. Tardos, How bad is selfish routing? J. ACM., 2002, 49(2): 236\u2013259.","journal-title":"J. ACM."},{"key":"8156_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"T. Roughgarden, The price of anarchy is independent of the network topology, J. Comput. System Sci., 2003, 67: 341\u2013364.","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"8156_CR9","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T. Roughgarden","year":"2004","unstructured":"T. Roughgarden, Stackelberg scheduling strategies, SIAM. J. Comput., 2004, 33(2): 332\u2013350.","journal-title":"SIAM. J. Comput."},{"issue":"3","key":"8156_CR10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","volume":"72","author":"R. Cole","year":"2006","unstructured":"R. Cole, Y. Dodis, and T. Roughgarden, How much can taxes help selfish routing? J. Comput. System Sci., 2006, 72(3): 444\u2013467.","journal-title":"J. Comput. System Sci."},{"key":"8156_CR11","volume-title":"Game Theory","author":"G. Oven","year":"1995","unstructured":"G. Oven, Game Theory, 3rd ed, Acadimic Press, New York, 1995.","edition":"3rd ed"},{"key":"8156_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, 1979."},{"issue":"4","key":"8156_CR13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10878-006-9000-1","volume":"12","author":"B. W. Zhang","year":"2006","unstructured":"B. W. Zhang, J. Z. Zhang, and L. Q. Qi. The shortest path improvement problem under Hamming distance, Journal of Combinatorial Optimization, 2006, 12(4): 351\u2013361.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8156-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-011-8156-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8156-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T05:34:57Z","timestamp":1559972097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-011-8156-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["8156"],"URL":"https:\/\/doi.org\/10.1007\/s11424-011-8156-7","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}