{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:07:15Z","timestamp":1745467635342,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_31","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T07:32:28Z","timestamp":1354606348000},"page":"420-433","source":"Crossref","is-referenced-by-count":2,"title":["The Price of Anarchy for Selfish Ring Routing Is Two"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Winzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"2","key":"31_CR3","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\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"31_CR4","unstructured":"Czumaj, A.: Selfish routing on the internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press (2004)"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibira. Internat. J. Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: ACM Symposium on Theory of Computing, pp. 428\u2013437 (2002)","DOI":"10.1145\/509967.509971"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact Price of Anarchy for Polynomial Congestion Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Heidelberg (2006)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. of the 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129626406002514","volume":"16","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The price of anarchy for restricted parallel links. Parallel Process. Lett.\u00a016(1), 117\u2013132 (2006)","journal-title":"Parallel Process. Lett."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Lin, H., Roughgarden, T., Tardos, \u00c9., Walkover, A.: Stronger bounds on Braess\u2019s paradox and the maximum latency of selfish routing (2011) (manuscript) http:\/\/theory.stanford.edu\/~tim\/papers\/mcbp.pdf","DOI":"10.1137\/090769600"},{"key":"31_CR12","unstructured":"GLORIAD: Global ring network for advanced applications development, http:\/\/www.gloriad.org"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Zhang, L.: Path decomposition under a new cost measure with applications to optical network design. ACM T. Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328926"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44634-6_15","volume-title":"Algorithms and Data Structures","author":"A. Blum","year":"2001","unstructured":"Blum, A., Kalai, A., Kleinberg, J.M.: Admission Control to Minimize Rejections. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 155\u2013164. Springer, Heidelberg (2001)"},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/S0895480101386723","volume":"17","author":"C.T. Cheng","year":"2004","unstructured":"Cheng, C.T.: Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings. SIAM J. Discrete Math.\u00a017(3), 384\u2013402 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A., Seymour, P.D., Winkler, P.: The ring loading problem. SIAM J. Discrete Math.\u00a011(1), 1\u201314 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jalgor.2004.03.003","volume":"54","author":"B.F. Wang","year":"2005","unstructured":"Wang, B.F.: Linear time algorithms for the ring loading problem with demand splitting. J. Algorithms\u00a054(1), 45\u201357 (2005)","journal-title":"J. Algorithms"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/s10878-008-9171-z","volume":"19","author":"B. Chen","year":"2010","unstructured":"Chen, B., Chen, X., Hu, X.: The price of atomic selfish ring routing. J. Comb. Optim.\u00a019(3), 258\u2013278 (2010)","journal-title":"J. Comb. Optim."},{"key":"31_CR20","unstructured":"Chen, B., Chen, X., Hu, J., Hu, X.: Stability vs. optimality in selfish ring routing (2011) (submitted), http:\/\/people.gucas.ac.cn\/upload\/UserFiles\/File\/20120203115847609411.pdf"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Chen, X., Doerr, B., Hu, X., Ma, W., van Stee, R., Winzen, C.: The price of anarchy for selfish ring routing is two. CoRR abs\/1210.0230 (2012)","DOI":"10.1007\/978-3-642-35311-6_31"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:49:29Z","timestamp":1745387369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}