{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T05:10:11Z","timestamp":1759036211575,"version":"3.44.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371317"],"award-info":[{"award-number":["12371317"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,9]]},"DOI":"10.1007\/s10878-025-01341-z","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T19:08:00Z","timestamp":1755630480000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strategy-proof mechanisms for maximizing social satisfaction in the facility location game"],"prefix":"10.1007","volume":"50","author":[{"given":"Xiaowei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"issue":"3","key":"1341_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N Alon","year":"2010","unstructured":"Alon N, Feldman M, Procaccia AD, Tennenholtz M (2010) Strategyproof approximation of the minimax on networks. Math Oper Res 35(3):513\u2013526","journal-title":"Math Oper Res"},{"key":"1341_CR2","unstructured":"Cai Q, Filos-Ratsikas A, Tang P (2016) Facility location with minimax envy. In: Proceedings of the 25th international joint conference on artificial intelligence, pp 137\u2013143"},{"key":"1341_CR3","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","DOI":"10.24963\/ijcai.2021\/596"},{"key":"1341_CR4","doi-asserted-by":"crossref","unstructured":"Cheng Y, Yu W, Zhang G (2011) Mechanisms for obnoxious facility game on a path. In: Proceedings of the 5th international conference on combinatorial optimization and applications, pp 262\u2013271","DOI":"10.1007\/978-3-642-22616-8_21"},{"key":"1341_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.tcs.2011.11.041","volume":"497","author":"Y Cheng","year":"2013","unstructured":"Cheng Y, Yu W, Zhang G (2013) Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoret Comput Sci 497:154\u2013163","journal-title":"Theoret Comput Sci"},{"key":"1341_CR6","doi-asserted-by":"crossref","unstructured":"Fotakis D, Tzamos C (2013) On the power of deterministic mechanisms for facility location games. In: Proceedings of the 40th international colloquium on automata, languages and programming, pp 449\u2013460","DOI":"10.1007\/978-3-642-39206-1_38"},{"key":"1341_CR7","first-page":"128479","volume":"466","author":"L Gai","year":"2024","unstructured":"Gai L, Liang M, Wang C (2024) Two-facility-location games with mixed types of agents. Appl Math Comput 466:128479","journal-title":"Appl Math Comput"},{"key":"1341_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10898-017-0586-x","volume":"70","author":"Q Han","year":"2018","unstructured":"Han Q, Du D, Xu D, Xu Y (2018) Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain. J Global Optim 70:859\u2013873","journal-title":"J Global Optim"},{"key":"1341_CR9","doi-asserted-by":"publisher","first-page":"114913","DOI":"10.1016\/j.tcs.2024.114913","volume":"1024","author":"P Kanellopoulos","year":"2025","unstructured":"Kanellopoulos P, Voudouris AA, Zhang R (2025) Truthful two-facility location with candidate locations. Theoret Comput Sci 1024:114913","journal-title":"Theoret Comput Sci"},{"key":"1341_CR10","doi-asserted-by":"crossref","unstructured":"Li M, Lu P, Yao Y, Zhang J (2020) Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio. In: Proceedings of the 29th international joint conference on artificial intelligence, pp 238\u2013245","DOI":"10.24963\/ijcai.2020\/34"},{"key":"1341_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.016","volume":"864","author":"W Liu","year":"2021","unstructured":"Liu W, Ding Y, Chen X, Fang Q, Nong Q (2021) Multiple facility location games with envy ratio. Theoret Comput Sci 864:1\u20139","journal-title":"Theoret Comput Sci"},{"key":"1341_CR12","doi-asserted-by":"crossref","unstructured":"Lu P, Sun X, Wang Y, Zhu ZA (2010) Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM conference on electronic commerce, pp 315\u2013324","DOI":"10.1145\/1807342.1807393"},{"key":"1341_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.dam.2019.02.017","volume":"264","author":"L Mei","year":"2019","unstructured":"Mei L, Li M, Ye D, Zhang G (2019) Facility location games with distinct desires. Discret Appl Math 264:148\u2013160","journal-title":"Discret Appl Math"},{"issue":"4","key":"1341_CR14","doi-asserted-by":"publisher","first-page":"177","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):177\u2013186","journal-title":"ACM Trans Econ Comput"},{"key":"1341_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2016.04.033","volume":"636","author":"P Serafino","year":"2016","unstructured":"Serafino P, Ventre C (2016) Heterogeneous facility location without money. Theoret Comput Sci 636:27\u201346","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"1341_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s10878-023-01017-6","volume":"45","author":"Q Zhao","year":"2023","unstructured":"Zhao Q, Liu W, Nong Q, Fang Q (2023) Constrained heterogeneous facility location games with max-variant cost. J Comb Optim 45(3):90","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01341-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01341-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01341-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:55:19Z","timestamp":1759035319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01341-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1341"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01341-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"17 July 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2025","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"13"}}