{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:21:30Z","timestamp":1778494890697,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971447"],"award-info":[{"award-number":["11971447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"ational 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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01163-5","type":"journal-article","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T20:10:33Z","timestamp":1714248633000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constrained heterogeneous two-facility location games with sum-variant"],"prefix":"10.1007","volume":"47","author":[{"given":"Qi","family":"Zhao","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":[[2024,4,27]]},"reference":[{"key":"1163_CR1","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":"1163_CR2","doi-asserted-by":"publisher","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 thirtieth international joint conference on artificial intelligence (IJCAI), pp 4356\u20134365. https:\/\/doi.org\/10.24963\/ijcai.2021\/596","DOI":"10.24963\/ijcai.2021\/596"},{"key":"1163_CR3","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. J Inf Process Lett 168:106098","journal-title":"J Inf Process Lett"},{"key":"1163_CR4","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1007\/s10878-021-00711-7","volume":"43","author":"X Chen","year":"2022","unstructured":"Chen X, Fang Q, Liu W, Ding Y, Nong Q (2022) Strategyproof mechanisms for 2-facility location games with minimax envy. J Comb Optim 43:1628\u20131644. https:\/\/doi.org\/10.1007\/s10878-021-00711-7","journal-title":"J Comb Optim"},{"key":"1163_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. https:\/\/doi.org\/10.1016\/j.tcs.2011.11.041","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"1163_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106710","volume":"148","author":"Y Ding","year":"2020","unstructured":"Ding Y, Liu W, Chen X, Fang Q, Nong Q (2020) Facility location game with envy ratio. Comput Ind Eng 148(3):106710. https:\/\/doi.org\/10.1016\/j.cie.2020.106710","journal-title":"Comput Ind Eng"},{"key":"1163_CR7","doi-asserted-by":"publisher","unstructured":"Dokow E, Feldman M, Meir R, Nehama I (2012) Mechanism design on discrete lines and cycles. In: Proceedings of the 13rd ACM conference on electronic commerce, pp 423\u2013440. https:\/\/doi.org\/10.1145\/2229012.2229045","DOI":"10.1145\/2229012.2229045"},{"key":"1163_CR8","unstructured":"Feigenbaum I, Sethuraman J (2015) Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. models. In: AAAI workshop: incentive and trust in Ecommunities"},{"key":"1163_CR9","doi-asserted-by":"publisher","unstructured":"Feldman M, Fiat A, Golomb I (2016) On voting and facility location. In: Proceedings of the 2016 ACM conference on economics and computation, pp 269\u2013286. https:\/\/doi.org\/10.1145\/2940716.2940725","DOI":"10.1145\/2940716.2940725"},{"key":"1163_CR10","doi-asserted-by":"publisher","unstructured":"Fong CKK, Li M, Lu P, Todo T, Yokoo c,M (2020) Facility location games with fractional preferences. In: Proceedings of the AAAI conference on artificial intelligence, vol 32, no. 1. https:\/\/doi.org\/10.1609\/aaai.v32i1.11458","DOI":"10.1609\/aaai.v32i1.11458"},{"key":"1163_CR11","doi-asserted-by":"crossref","unstructured":"Gai L, Liang M, Wang C (2022) Obnoxious facility location games with candidate locations. In: AAIM 2022, LNCS 13513. Springer, Cham","DOI":"10.1007\/978-3-031-16081-3_9"},{"key":"1163_CR12","doi-asserted-by":"publisher","unstructured":"Kanellopoulos P, Voudouris A A, Zhang R (2023) Truthful two-facility location with candidate locations. In: SAGT 2023, LNCS 14238, pp 365\u2013382. https:\/\/doi.org\/10.1007\/978-3-031-43254-5_21","DOI":"10.1007\/978-3-031-43254-5_21"},{"key":"1163_CR13","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. https:\/\/doi.org\/10.1016\/j.tcs.2021.01.016","journal-title":"Theoret Comput Sci"},{"key":"1163_CR14","doi-asserted-by":"publisher","unstructured":"Lu P, Wang Y, Zhou Y (2009) Tighter bounds for facility games. In: Proceedings of the 5th international workshop on internet and network economics, pp 137\u2013148. https:\/\/doi.org\/10.1007\/978-3-642-10841-9","DOI":"10.1007\/978-3-642-10841-9"},{"key":"1163_CR15","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/1807342.1807393","DOI":"10.1145\/1807342.1807393"},{"issue":"4","key":"1163_CR16","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin H (1980) On strategy-proofness and single peakedness. Public Choice 35(4):437\u2013455. https:\/\/doi.org\/10.1007\/BF00128122","journal-title":"Public Choice"},{"key":"1163_CR17","doi-asserted-by":"publisher","unstructured":"Procaccia AD, Tennenholtz M (2009) Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on electronic commerce, pp 177\u2013186. https:\/\/doi.org\/10.1145\/1566374.1566401","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"1163_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J Schummer","year":"2002","unstructured":"Schummer J, Vohra R (2002) Strategy-proof location on a network. J Econ Theory 104(2):405\u2013428. https:\/\/doi.org\/10.1006\/jeth.2001.2807","journal-title":"J Econ Theory"},{"key":"1163_CR19","unstructured":"Sui X, Boutilier C (2015) Approximately strategy-proof mechanisms for (constrained) facility location. In: Proceedings of the 14th international conference on autonomous agents and multiagent systems, pp 605\u2013613"},{"key":"1163_CR20","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. https:\/\/doi.org\/10.1016\/j.tcs.2016.04.033","journal-title":"Theoret Comput Sci"},{"key":"1163_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-021-00378-1","author":"Z Tang","year":"2022","unstructured":"Tang Z, Wang C, Zhang M, Zhao Y (2022) Strategyproof facility location with limited locations. J Oper Res Soc China. https:\/\/doi.org\/10.1007\/s40305-021-00378-1","journal-title":"J Oper Res Soc China"},{"key":"1163_CR22","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. J Artific Intell Res 70:719\u2013756. https:\/\/doi.org\/10.1613\/jair.1.12319","journal-title":"J Artific Intell Res"},{"key":"1163_CR23","doi-asserted-by":"publisher","unstructured":"Ye D, Mei L, Zhang Y (2015) Strategy-proof mechanism for obnoxious facility location on a line. In: International computing and combinatorics conference, pp 45\u201356. https:\/\/doi.org\/10.1007\/978-3-319-21398-9_4","DOI":"10.1007\/978-3-319-21398-9_4"},{"key":"1163_CR24","doi-asserted-by":"publisher","unstructured":"Yuan H, Wang K, Fong KC, Zhang Y, Li M (2016) Facility location games with optional preference. In: Proceedings of the 22nd European conference on artificial intelligence, pp 1520\u20131527. https:\/\/doi.org\/10.3233\/978-1-61499-672-9-1520","DOI":"10.3233\/978-1-61499-672-9-1520"},{"issue":"4","key":"1163_CR25","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/s10878-013-9598-8","volume":"28","author":"Q Zhang","year":"2014","unstructured":"Zhang Q, Li M (2014) Strategyproof mechanism design for facility location games with weighted agents on a line. J Comb Optim 28(4):756\u2013773. https:\/\/doi.org\/10.1007\/s10878-013-9598-8","journal-title":"J Comb Optim"},{"issue":"3","key":"1163_CR26","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, Fang Q, Nong Q (2023) Constrained heterogeneous two-facility location games with max-variant cost. J Comb Optim 45(3):90. https:\/\/doi.org\/10.1007\/s10878-023-01017-6","journal-title":"J Comb Optim"},{"key":"1163_CR27","unstructured":"Zou S, Li M (2015) Facility location games with dual preference. In: Proceedings of the 14th international conference on autonomous agents and multiagent systems, pp 615\u2013623"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01163-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:11:42Z","timestamp":1715951502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01163-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1163"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01163-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"31 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"65"}}