{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:16Z","timestamp":1750308736993,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["kjcx-yw-s7"],"award-info":[{"award-number":["kjcx-yw-s7"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2011CB80800"],"award-info":[{"award-number":["2011CB80800"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11222109, 11021161, 10928102"],"award-info":[{"award-number":["11222109, 11021161, 10928102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-09-JCJC-0067-01"],"award-info":[{"award-number":["ANR-09-JCJC-0067-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CONNECT"},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum latency among all players as social cost. This important social cost function is much less understood than the average latency. We show that the price of anarchy is at most two, when the network is a ring and the link latencies are linear. Our bound is tight. This is the first sharp bound for the maximum latency objective.<\/jats:p>","DOI":"10.1145\/2548545","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:50:17Z","timestamp":1402404617000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Price of Anarchy for Selfish Ring Routing is Two"],"prefix":"10.1145","volume":"2","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[{"name":"Institute of Applied Mathematics, AMSS, Chinese Academy of Sciences"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics and \u00c9cole Polytechnique"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics and Universit\u00e9 Paris Diderot"}]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[{"name":"Institute of Applied Mathematics, AMSS, Chinese Academy of Sciences"}]},{"given":"Weidong","family":"Ma","sequence":"additional","affiliation":[{"name":"Institute of Applied Mathematics, AMSS, Chinese Academy of Sciences"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_17"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.68"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328926"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"volume-title":"Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS). 155--164","author":"Blum A.","key":"e_1_2_1_5_1","unstructured":"Blum , A. , Kalai , A. , and Kleinberg , J. M . 2001. Admission control to minimize rejections . In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS). 155--164 . Blum, A., Kalai, A., and Kleinberg, J. M. 2001. Admission control to minimize rejections. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS). 155--164."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Chen B. Chen X. and Hu J. 2013. Stability vs. optimality in selfish ring routing. Acta Math. Sin. (Engl. Ser.) to appear.  Chen B. Chen X. and Hu J. 2013. Stability vs. optimality in selfish ring routing. Acta Math. Sin. (Engl. Ser.) to appear.","DOI":"10.1007\/s10114-014-3055-1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9171-z"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101386723"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J.Y. Leung (Ed)","author":"Czumaj A.","key":"e_1_2_1_10_1","unstructured":"Czumaj , A. 2004. Selfish routing on the internet . In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J.Y. Leung (Ed) , CRC Press . Czumaj, A. 2004. Selfish routing on the internet. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J.Y. Leung (Ed), CRC Press."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626406002514"},{"key":"e_1_2_1_12_1","unstructured":"GLORIAD. 2013. Global ring network for advanced applications development. http:\/\/www.gloriad.org.  GLORIAD. 2013. Global ring network for advanced applications development. http:\/\/www.gloriad.org."},{"volume-title":"Proceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science (STACS). 404--413","author":"Koutsoupias E.","key":"e_1_2_1_13_1","unstructured":"Koutsoupias , E. and Papadimitriou , C. H . 1999. Worst-case equilibria . In Proceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science (STACS). 404--413 . Koutsoupias, E. and Papadimitriou, C. H. 1999. Worst-case equilibria. In Proceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science (STACS). 404--413."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.003"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769600"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380846"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00044-8"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195294994"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.03.003"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2548545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2548545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:05Z","timestamp":1750278125000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2548545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1145\/2548545"],"URL":"https:\/\/doi.org\/10.1145\/2548545","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2013-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}