{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:13:31Z","timestamp":1783750411659,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"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":["12201590"],"award-info":[{"award-number":["12201590"]}],"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":["12171444"],"award-info":[{"award-number":["12171444"]}],"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":["ZR2024MA031"],"award-info":[{"award-number":["ZR2024MA031"]}],"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":[[2026,8]]},"DOI":"10.1007\/s10878-026-01439-y","type":"journal-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:43:59Z","timestamp":1783748639000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mechanism design for facility location games under a prelocated facility"],"prefix":"10.1007","volume":"52","author":[{"given":"Genjie","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4826-2088","authenticated-orcid":false,"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,11]]},"reference":[{"key":"1439_CR1","unstructured":"Alon N, Feldman M, Procaccia AD, Tennenholtz M (2009) Strategyproof approximation mechanisms for location on networks. CoRR,abs\/0907.2049"},{"key":"1439_CR2","doi-asserted-by":"crossref","unstructured":"Chan H, Wang C (2023) Mechanism design for improving accessibility to public facilities. Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems. pp 2116\u20132124","DOI":"10.65109\/JBGK1918"},{"key":"1439_CR3","doi-asserted-by":"crossref","unstructured":"Chan H, Fu X, Li M, Wang C (2024) Mechanism design for reducing agent distances to prelocated facilities. Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems. pp 2180\u20132182","DOI":"10.65109\/XRGK1509"},{"key":"1439_CR4","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: 30th International Joint Conference on Artificial Intelligence, pp. 4356\u20134365. International Joint Conferences on Artificial Intelligence Organization","DOI":"10.24963\/ijcai.2021\/596"},{"key":"1439_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106098","volume":"168","author":"X Chen","year":"2021","unstructured":"Chen X, Hu X, Tang Z, Wang C (2021) Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. Inf Process Lett 168:106098","journal-title":"Inf Process Lett"},{"key":"1439_CR6","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":"1439_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.geb.2023.03.001","volume":"139","author":"A Deligkas","year":"2023","unstructured":"Deligkas A, Filos-Ratsikas A, Voudouris AA (2023) Heterogeneous facility location with limited resources. Games Econom Behav 139:200\u2013215","journal-title":"Games Econom Behav"},{"key":"1439_CR8","doi-asserted-by":"crossref","unstructured":"Feldman M, Wilf Y (2013) Strategyproof facility location and the least squares objective. Proceedings of the Fourteenth ACM Conference on Electronic Commerce. pp 873\u2013890","DOI":"10.1145\/2492002.2482543"},{"key":"1439_CR9","doi-asserted-by":"crossref","unstructured":"Fong CKK, Li M, Lu P, Todo T, Yokoo M (2018) Facility location games with fractional preferences. Proceedings of the AAAI Conference on Artificial Intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11458"},{"key":"1439_CR10","doi-asserted-by":"crossref","unstructured":"Fotakis D, Tzamos C (2013) Strategyproof facility location for concave cost functions. Proceedings of the Fourteenth ACM Conference on Electronic Commerce. pp 435\u2013452","DOI":"10.1145\/2492002.2482595"},{"issue":"4","key":"1439_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2665005","volume":"2","author":"D Fotakis","year":"2014","unstructured":"Fotakis D, Tzamos C (2014) On the power of deterministic mechanisms for facility location games. ACM Transactions on Economics and Computation (TEAC) 2(4):1\u201337","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"1439_CR12","doi-asserted-by":"crossref","unstructured":"Li M, Lu P, Yao Y, Zhang J (2021) Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio. Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. pp 238\u2013245","DOI":"10.24963\/ijcai.2020\/34"},{"key":"1439_CR13","doi-asserted-by":"crossref","unstructured":"Lu P, Sun X, Wang Y, Zhu ZA (2010) Asymptotically optimal strategy-proof mechanisms for two-facility games. Proceedings of the 11th ACM Conference on Electronic Commerce. pp 315\u2013324","DOI":"10.1145\/1807342.1807393"},{"issue":"4","key":"1439_CR14","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 Transactions on Economics and Computation (TEAC) 1(4):1\u201326","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"1439_CR15","doi-asserted-by":"crossref","unstructured":"Qin Z, Chan H, Wang C, Zhang Y (2024) Mechanism design for building optimal bridges between regions. Annual Conference on Theory and Applications of Models of Computation. Springer, Singapore, pp 332\u2013343","DOI":"10.1007\/978-981-97-2340-9_28"},{"key":"1439_CR16","doi-asserted-by":"crossref","unstructured":"Serafino P, Ventre C (2015) Truthful mechanisms without money for non-utilitarian heterogeneous facility location. Proceedings of the AAAI Conference on Artificial Intelligence, vol 29","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"1439_CR17","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"},{"key":"1439_CR18","doi-asserted-by":"crossref","unstructured":"Tang Z, Wang C, Zhang M, Zhao Y (2020) Mechanism design for facility location games with candidate locations. International Conference on Combinatorial Optimization and Applications. Springer, Dallas, Texas, pp 440\u2013452","DOI":"10.1007\/978-3-030-64843-5_30"},{"key":"1439_CR19","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1613\/jair.1.12319","volume":"70","author":"X Xu","year":"2021","unstructured":"Xu X, Li B, Li M, Duan L (2021) Two-facility location games with minimum distance requirement. Journal of Artificial Intelligence Research 70:719\u2013756","journal-title":"Journal of Artificial Intelligence Research"},{"key":"1439_CR20","doi-asserted-by":"crossref","unstructured":"Ye D, Mei L, Zhang Y (2015) Strategy-proof mechanism for obnoxious facility location on a line. International Computing and Combinatorics Conference. Springer, Beijing, pp 45\u201356","DOI":"10.1007\/978-3-319-21398-9_4"},{"key":"1439_CR21","unstructured":"Yuan H, Wang K, Fong KC, Zhang Y, Li M (2016) Facility location games with optional preference. ECAI 2016. IOS Press, Amsterdam, pp 1520\u20131527"},{"key":"1439_CR22","doi-asserted-by":"crossref","unstructured":"Zou S, Li M (2015) Facility location games with dual preference. Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. pp 615\u2013623","DOI":"10.65109\/MZYJ6728"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01439-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:44:02Z","timestamp":1783748642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01439-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,11]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1439"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01439-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,11]]},"assertion":[{"value":"1 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2026","order":3,"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"}}],"article-number":"1"}}