{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:44Z","timestamp":1740122384086,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T00:00:00Z","timestamp":1663027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T00:00:00Z","timestamp":1663027200000},"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":["12171444","11971447"],"award-info":[{"award-number":["12171444","11971447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871442"],"award-info":[{"award-number":["11871442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MA052"],"award-info":[{"award-number":["ZR2019MA052"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00905-7","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T12:04:26Z","timestamp":1663070666000},"page":"3520-3534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding quality of pure Nash equilibria in dual-role facility location games"],"prefix":"10.1007","volume":"44","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4826-2088","authenticated-orcid":false,"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"issue":"3","key":"905_CR1","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/moor.2018.0948","volume":"44","author":"O Ben-Porat","year":"2019","unstructured":"Ben-Porat O, Tennenholtz M (2019) Multiunit facility location games. Math Oper Res 44(3):865\u2013889","journal-title":"Math Oper Res"},{"issue":"6","key":"905_CR2","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J Byrka","year":"2010","unstructured":"Byrka J, Aardal K (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39(6):2212\u2013223","journal-title":"SIAM J Comput"},{"doi-asserted-by":"crossref","unstructured":"Chan H, Filos-Ratsikas A, Li B, Li M, Wang C (2021) Mechanism design for facility location problems: a survey. In: proceedings of the 30th international joint conference on artificial intelligence, pp 4356\u20134365","key":"905_CR3","DOI":"10.24963\/ijcai.2021\/596"},{"doi-asserted-by":"crossref","unstructured":"Chan H, Li M, Wang C, Wu X (2021) Facility\u2019s perspective to fair facility location problems. In: proceedings of the 35th AAAI conference on artificial intelligence 35(6): 5734\u20135741","key":"905_CR4","DOI":"10.1609\/aaai.v35i6.16719"},{"unstructured":"Chen X, Li M, Wang C, Zhao Y (2019) Truthful mechanisms for location games of dual-role facilities. In: proceedings of the 18th international conference on autonomous agents and multiagent systems, pp 1470\u20131478","key":"905_CR5"},{"issue":"2","key":"905_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1086\/257897","volume":"65","author":"A Downs","year":"1957","unstructured":"Downs A (1957) An economic theory of political action in a democracy. J Polit Econ 65(2):135\u2013150","journal-title":"J Polit Econ"},{"issue":"1","key":"905_CR7","first-page":"212","volume":"44","author":"G Fournier","year":"2018","unstructured":"Fournier G, Scarsini M (2018) Location games on networks: existence and efficiency of equilibria. Math Oper Res 44(1):212\u2013235","journal-title":"Math Oper Res"},{"issue":"1","key":"905_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B Gavish","year":"1991","unstructured":"Gavish B (1991) Topological design of telecommunication networks-local access design methods. Ann Oper Res 33(1):17\u201371","journal-title":"Ann Oper Res"},{"issue":"1","key":"905_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31(1):28\u2013248","journal-title":"J Algorithms"},{"issue":"1","key":"905_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum DS (1982) Heuristics for the fixed cost median problem. Math Program 22(1):148\u2013162","journal-title":"Math Program"},{"issue":"153","key":"905_CR11","first-page":"41","volume":"39","author":"H Hotelling","year":"1929","unstructured":"Hotelling H (1929) Stability in competition. Econom J 39(153):41\u201347","journal-title":"Econom J"},{"issue":"1","key":"905_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/game.1993.1007","volume":"5","author":"MJ Osborne","year":"1993","unstructured":"Osborne MJ (1993) Candidate positioning and entry in a political competition. Games Econom Behav 5(1):133\u2013151","journal-title":"Games Econom Behav"},{"issue":"4","key":"905_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia AD, Tennenholtz M (2013) Approximate mechanism design without money. ACM Trans Econ Comput 1(4):1\u201326","journal-title":"ACM Trans Econ Comput"},{"issue":"5","key":"905_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden T (2015) Intrinsic robustness of the price of anarchy. J ACM 62(5):1\u201342","journal-title":"J ACM"},{"key":"905_CR15","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2009","unstructured":"Kaufman L, Rousseeuw PJ (2009) Finding groups in data: an introduction to cluster analysis. John Wiley & Sons, New Jersey"},{"issue":"2","key":"905_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"MT Melo","year":"2009","unstructured":"Melo MT, Nickel S, Saldanha-Da-Gama F (2009) Facility location and supply chain management-a review. Eur J Oper Res 196(2):401\u2013412","journal-title":"Eur J Oper Res"},{"key":"905_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos \u00c9, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, New York"},{"doi-asserted-by":"crossref","unstructured":"Shmoys DB, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. In: proceedings of the 29th annual ACM symposium on theory of computing, pp 265\u2013274","key":"905_CR18","DOI":"10.1145\/258533.258600"},{"doi-asserted-by":"crossref","unstructured":"Vetta A (2002) Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: proceedings of the 43rd annual IEEE symposium on foundations of computer science, pp 416\u2013425","key":"905_CR19","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00905-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00905-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00905-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:40:35Z","timestamp":1667036435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00905-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,13]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["905"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00905-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,9,13]]},"assertion":[{"value":"29 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}