{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:24:45Z","timestamp":1792070685972,"version":"4.4.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"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":"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10878-023-01017-6","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T15:43:08Z","timestamp":1680536588000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Constrained heterogeneous facility location games with max-variant cost"],"prefix":"10.1007","volume":"45","author":[{"given":"Qi","family":"Zhao","sequence":"first","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"key":"1017_CR1","unstructured":"Anastasiadis E, Deligkas A (2018) Heterogeneous facility location games. In: Proceedings of the 17th international conference on autonomous agents and multiagent systems, pp 623\u2013631"},{"key":"1017_CR2","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.geb.2020.09.001","volume":"124","author":"H Aziz","year":"2020","unstructured":"Aziz H, Chan H, Lee B, Parkes DC (2020) The capacity constrained facility location problem. Games Econ Behav 124:478\u2013490. https:\/\/doi.org\/10.1016\/j.geb.2020.09.001","journal-title":"Games Econ Behav"},{"key":"1017_CR3","doi-asserted-by":"publisher","unstructured":"Aziz H, Chan H, Lee B, Li B, Walsh T (2020) Facility location problem with capacity constraints: algorithmic and mechanism design perspectives. In: Proceedings of the 34th AAAI conference on artificial intelligence vol 34, no 2, pp 1806\u20131813. https:\/\/doi.org\/10.1609\/aaai.v34i02.5547","DOI":"10.1609\/aaai.v34i02.5547"},{"key":"1017_CR4","volume-title":"The theory of commut\u00e9es and elections","author":"D Black","year":"1958","unstructured":"Black D (1958) The theory of commut\u00e9es and elections. Cambridge University Press, Cambridge"},{"key":"1017_CR5","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":"1017_CR6","doi-asserted-by":"publisher","first-page":"106098","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. https:\/\/doi.org\/10.1016\/j.ipl.2021.106098","journal-title":"Inf Process Lett"},{"key":"1017_CR7","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 Combin Optim 43:1628\u20131644","journal-title":"J Combin Optim"},{"key":"1017_CR8","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. Theor Comput Sci 497:154\u2013163. https:\/\/doi.org\/10.1016\/j.tcs.2011.11.041","journal-title":"Theor Comput Sci"},{"issue":"3","key":"1017_CR9","doi-asserted-by":"publisher","first-page":"106710","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":"1017_CR10","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"},{"issue":"2","key":"1017_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1287\/moor.2016.0810","volume":"42","author":"I Feigenbaum","year":"2017","unstructured":"Feigenbaum I, Sethuraman J, Ye C (2017) Approximately optimal mechanisms for strategyproof facility location: minimizing $$L_p$$ norm of costs. Comput Sci Game Theory 42(2):277\u2013575. https:\/\/doi.org\/10.1287\/moor.2016.0810","journal-title":"Comput Sci Game Theory"},{"key":"1017_CR12","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":"1017_CR13","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1007\/s10458-017-9361-0","volume":"31","author":"A Filos-Ratsikas","year":"2017","unstructured":"Filos-Ratsikas A, Li M, Zhang J, Zhang Q (2017) Facility location with double-peaked preferences. Auton Agents Multi-Agent Syst 31:1209\u20131235","journal-title":"Auton Agents Multi-Agent Syst"},{"issue":"4","key":"1017_CR14","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 Trans Econ Comput 2(4):1\u201337. https:\/\/doi.org\/10.1145\/2665005","journal-title":"ACM Trans Econ Comput"},{"key":"1017_CR15","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.24963\/ijcai.2020\/34","DOI":"10.24963\/ijcai.2020\/34"},{"key":"1017_CR16","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. Theor Comput Sci 864:1\u20139. https:\/\/doi.org\/10.1016\/j.tcs.2021.01.016","journal-title":"Theor Comput Sci"},{"key":"1017_CR17","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"},{"key":"1017_CR18","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. Discrete Appl Math 264:148\u2013160. https:\/\/doi.org\/10.1016\/j.dam.2019.02.017","journal-title":"Discrete Appl Math"},{"issue":"4","key":"1017_CR19","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":"1017_CR20","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":"1017_CR21","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":"1017_CR22","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. Theor Comput Sci 636:27\u201346. https:\/\/doi.org\/10.1016\/j.tcs.2016.04.033","journal-title":"Theor Comput Sci"},{"key":"1017_CR23","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":"1017_CR24","doi-asserted-by":"crossref","unstructured":"Tang Z, Wang C, Zhang M, Zhao Y (2020) Mechanism design for facility location games with candidate locations. In: International conference on combinatorial optimization and applications, pp 440\u2013452","DOI":"10.1007\/978-3-030-64843-5_30"},{"key":"1017_CR25","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 Artif Intell Res 70:719\u2013756. https:\/\/doi.org\/10.1613\/jair.1.12319","journal-title":"J Artif Intell Res"},{"key":"1017_CR26","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 520\u20131527. https:\/\/doi.org\/10.3233\/978-1-61499-672-9-1520","DOI":"10.3233\/978-1-61499-672-9-1520"},{"issue":"4","key":"1017_CR27","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 Combin Optim 28(4):756\u2013773. https:\/\/doi.org\/10.1007\/s10878-013-9598-8","journal-title":"J Combin Optim"},{"key":"1017_CR28","doi-asserted-by":"crossref","unstructured":"Zhou H, Li M, Chan H (2021) Strategyproof mechanisms for group-fair facility location problems. arXiv:2107.05175","DOI":"10.24963\/ijcai.2022\/87"},{"key":"1017_CR29","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-023-01017-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01017-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01017-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:35:05Z","timestamp":1682368505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01017-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,30]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01017-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,30]]},"assertion":[{"value":"7 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","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"}}],"article-number":"90"}}