{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T04:25:34Z","timestamp":1684470334956},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,16]],"date-time":"2008-06-16T00:00:00Z","timestamp":1213574400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10878-008-9171-z","type":"journal-article","created":{"date-parts":[[2008,6,15]],"date-time":"2008-06-15T20:01:50Z","timestamp":1213560110000},"page":"258-278","source":"Crossref","is-referenced-by-count":7,"title":["The price of atomic selfish ring routing"],"prefix":"10.1007","volume":"19","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xujin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,16]]},"reference":[{"key":"9171_CR1","unstructured":"Aggarwal A, Bar-Noy A, Coppersmith D, Ramaswami R, Schieber B, Sudan M (1994) Efficient routing and scheduling algorithms for optical networks. In: Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, pp\u00a0412\u2013423"},{"key":"9171_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich E, Dasgupta A, Kleinberg J, Tardos E, Wexler T, Roughgarden T (2004) The price of stability for network design with fair cost allocation. In: Proceedings of the 45th annual symposium on foundations of computer science, pp\u00a0295\u2013304","DOI":"10.1109\/FOCS.2004.68"},{"key":"9171_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Epstein L (2005) The price of routing unsplittable flow. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp\u00a057\u201366","DOI":"10.1145\/1060590.1060599"},{"key":"9171_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-44634-6_15","volume":"2152","author":"A Blum","year":"2001","unstructured":"Blum A, Kalai A, Kleinberg J (2001) Admission control to minimize rejections. Lect Not Comput Sci 2152:155\u2013164","journal-title":"Lect Not Comput Sci"},{"key":"9171_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/11775096_9","volume":"4041","author":"C Busch","year":"2006","unstructured":"Busch C, Magdon-Ismail M (2006) Atomic routing games on maximum congestion. Lect Not Comput Sci 4041:79\u201391","journal-title":"Lect Not Comput Sci"},{"key":"9171_CR6","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Koutsoupias E (2005) The price of anarchy of finite congestion games. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp\u00a067\u201373","DOI":"10.1145\/1060590.1060600"},{"key":"9171_CR7","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/11786986_46","volume":"4051","author":"R Cominetti","year":"2006","unstructured":"Cominetti R, Correa JR, Stier-Moses NE (2006) Network games with atomic players. Lect Not Comput Sci 4051:525\u2013536","journal-title":"Lect Not Comput Sci"},{"key":"9171_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"JR Correa","year":"2007","unstructured":"Correa JR, Schulz AS, Stier-Moses NE (2007) Fast, fair, and efficient flows in networks. Oper Res 55:215\u2013225","journal-title":"Oper Res"},{"key":"9171_CR9","series-title":"Chapman & Hall\/CRC computer and information science series","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"A Czumaj","year":"2004","unstructured":"Czumaj A (2004) Selfish routing on the Internet. In: Leung J (ed) Handbook of scheduling: algorithms, models, and performance analysis. Chapman & Hall\/CRC computer and information science series, vol\u00a01. CRC Press, Boca Raton. Chap\u00a042"},{"key":"9171_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure Nash equilibria. In: Proceedings of the 36th annual ACM symposium on theory of computing, pp\u00a0604\u2013612","DOI":"10.1145\/1007352.1007445"},{"key":"9171_CR11","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakisa","year":"2005","unstructured":"Fotakisa D, Kontogiannisa S, Spirakis P (2005) Selfish unsplittable flows. Theor Comput Sci 348:226\u2013239","journal-title":"Theor Comput Sci"},{"key":"9171_CR12","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume":"1563","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias E, Papadimitriou CH (1999) Worst-case equilibria. Lect Not Comput Sci 1563:404\u2013413","journal-title":"Lect Not Comput Sci"},{"key":"9171_CR13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley L (1996) Potential games. Game Econ Behav 14:124\u2013143","journal-title":"Game Econ Behav"},{"key":"9171_CR14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/11523468_41","volume":"3580","author":"H Lin","year":"2005","unstructured":"Lin H, Roughgarden T, Tardos E, Walkover A (2005) Braess\u2019s paradox, Fibonacci Numbers, and exponential inapproximability. Lect Not Comput Sci 3580:497\u2013512","journal-title":"Lect Not Comput Sci"},{"key":"9171_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2:65\u201367","journal-title":"Int J Game Theory"},{"key":"9171_CR16","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2003","unstructured":"Roughgarden T (2003) The price of anarchy is independent of the network topology. J Comput Sys Sci 67:342\u2013364","journal-title":"J Comput Sys Sci"},{"key":"9171_CR17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos E (2002) How bad is selfish routing? J\u00a0ACM 49:236\u2013259","journal-title":"J\u00a0ACM"},{"key":"9171_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A Schrijver","year":"1998","unstructured":"Schrijver A, Seymour P, Winkler P (1998) The ring loading problem. SIAM J Discrete Math 11:1\u201314","journal-title":"SIAM J Discrete Math"},{"key":"9171_CR19","unstructured":"Weitz D (2001) The price of anarchy. Unpublished manuscript"},{"key":"9171_CR20","unstructured":"Wilfong G, Winkler P (1998) Ring routing and wavelength translation. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms, pp\u00a0333\u2013341"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9171-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9171-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9171-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T20:33:39Z","timestamp":1684442019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9171-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,16]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9171-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,16]]}}}