{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T11:13:25Z","timestamp":1784805205367,"version":"3.55.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"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":["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":["12171444"],"award-info":[{"award-number":["12171444"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10458-025-09722-8","type":"journal-article","created":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T05:54:30Z","timestamp":1760334870000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heterogeneous facility location games with fractional preferences and limited resources"],"prefix":"10.1007","volume":"39","author":[{"given":"Jiazhu","family":"Fang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"9722_CR1","doi-asserted-by":"crossref","unstructured":"Fang, J., & Liu, W. (2024). Facility location games with fractional preferences and limited resources. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems. AAMAS \u201924, pp. 553\u2013561. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/JCCC4064"},{"key":"9722_CR2","doi-asserted-by":"crossref","unstructured":"Elkind, E., Li, M., & Zhou, H. (2022). Facility location with approval preferences: Strategyproofness and fairness. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. AAMAS \u201922, pp. 391\u2013399. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/XAYV6886"},{"key":"9722_CR3","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, A. A. (2023). Heterogeneous facility location with limited resources. Games and Economic Behavior, 139, 200\u2013215.","journal-title":"Games and Economic Behavior"},{"issue":"4","key":"9722_CR4","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.","journal-title":"Public Choice"},{"issue":"4","key":"9722_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A. D., & 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)"},{"issue":"3","key":"9722_CR6","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, A. D., & Tennenholtz, M. (2010). Strategyproof approximation of the minimax on networks. Mathematics of Operations Research, 35(3), 513\u2013526.","journal-title":"Mathematics of Operations Research"},{"key":"9722_CR7","doi-asserted-by":"crossref","unstructured":"Meir, R. (2019). Strategyproof facility location for three agents on a circle. In: Algorithmic Game Theory: 12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings, pp. 18\u201333. Springer, Berlin.","DOI":"10.1007\/978-3-030-30473-7_2"},{"key":"9722_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., & Wilf, Y. (2018). Strategyproof facility location and the least squares objective. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce. EC \u201913, pp. 873\u2013890. Association for Computing Machinery, New York.","DOI":"10.1145\/2492002.2482543"},{"key":"9722_CR9","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., & Nehama, I. (2012). Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM Conference on Electronic Commerce. EC \u201912, pp. 423\u2013440. Association for Computing Machinery, New York.","DOI":"10.1145\/2229012.2229045"},{"issue":"1","key":"9722_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s10458-022-09592-4","volume":"37","author":"A Filimonov","year":"2023","unstructured":"Filimonov, A., & Meir, R. (2023). Strategyproof facility location mechanisms on discrete trees. Autonomous Agents and Multi-Agent Systems, 37(1), 10.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9722_CR11","doi-asserted-by":"crossref","unstructured":"Tang, P., Yu, D., & Zhao, S. (2020). Characterization of group-strategyproof mechanisms for facility location in strictly convex space. In: Proceedings of the 21st ACM Conference on Economics and Computation. EC \u201920, pp. 133\u2013157. Association for Computing Machinery, New York.","DOI":"10.1145\/3391403.3399471"},{"issue":"6","key":"9722_CR12","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. Autonomous Agents and Multi-Agent Systems, 31(6), 1209\u20131235.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9722_CR13","doi-asserted-by":"crossref","unstructured":"Fotakis, D., & Tzamos, C. (2013) Strategyproof facility location for concave cost functions. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce. EC \u201913, pp. 435\u2013452. Association for Computing Machinery, New York.","DOI":"10.1145\/2492002.2482595"},{"issue":"2","key":"9722_CR14","doi-asserted-by":"publisher","first-page":"434","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 lp norm of costs. Mathematics of Operations Research, 42(2), 434\u2013447.","journal-title":"Mathematics of Operations Research"},{"key":"9722_CR15","unstructured":"Cai, Q., Filos-Ratsikas, A., & Tang, P. (2016). Facility location with minimax envy. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. IJCAI\u201916, pp. 137\u2013143. AAAI Press, New York."},{"key":"9722_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. Theoretical Computer Science, 864, 1\u20139.","journal-title":"Theoretical Computer Science"},{"key":"9722_CR17","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 Applied Mathematics, 264, 148\u2013160.","journal-title":"Discrete Applied Mathematics"},{"key":"9722_CR18","doi-asserted-by":"crossref","unstructured":"Todo, T., Iwasaki, A., & Yokoo, M. (2011). False-name-proof mechanism design without money. In: The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2. AAMAS \u201911, pp. 651\u2013658. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/LACT1197"},{"issue":"1","key":"9722_CR19","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1609\/aaai.v30i1.10029","volume":"30","author":"A Sonoda","year":"2016","unstructured":"Sonoda, A., Todo, T., & Yokoo, M. (2016). False-name-proof locations of two facilities: Economic and algorithmic approaches. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1), 615\u2013621.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"9722_CR20","doi-asserted-by":"crossref","unstructured":"Nehama, I., Todo, T., & Yokoo, M. (2019). Manipulations-resistant facility location mechanisms for zv-line graphs. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS \u201919, pp. 1452\u20131460. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/JWUU9223"},{"key":"9722_CR21","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2012.11.036","volume":"472","author":"D Fotakis","year":"2013","unstructured":"Fotakis, D., & Tzamos, C. (2013). Winner-imposing strategyproof mechanisms for multiple facility location games. Theoretical Computer Science, 472, 90\u2013103.","journal-title":"Theoretical Computer Science"},{"key":"9722_CR22","doi-asserted-by":"crossref","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. WINE \u201909, pp. 137\u2013148. Springer, Berlin.","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"9722_CR23","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. E., & Parkes, D. C. (2020). The capacity constrained facility location problem. Games and Economic Behavior, 124, 478\u2013490.","journal-title":"Games and Economic Behavior"},{"key":"9722_CR24","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., & Golomb, I. (2016). On voting and facility location. In: Proceedings of the 2016 ACM Conference on Economics and Computation. EC \u201916, pp. 269\u2013286. Association for Computing Machinery, New York.","DOI":"10.1145\/2940716.2940725"},{"issue":"4","key":"9722_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.","journal-title":"J. Comb. Optim."},{"key":"9722_CR26","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., & Voudouris, A. A. (2021). Approximate mechanism design for distributed facility location. In: Algorithmic Game Theory: 14th International Symposium. SAGT\u201921, pp. 49\u201363. Springer, Berlin.","DOI":"10.1007\/978-3-030-85947-3_4"},{"key":"9722_CR27","doi-asserted-by":"crossref","unstructured":"Anastasiadis, E., & Deligkas, A. (2018). Heterogeneous facility location games. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS \u201918, pp. 623\u2013631. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/WUZF8079"},{"key":"9722_CR28","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-981-97-2340-9_4","volume-title":"Theory and Applications of Models of Computation","author":"J Fang","year":"2024","unstructured":"Fang, J., Fang, Q., Liu, W., & Nong, Q. (2024). Mechanism design with predictions for facility location games with candidate locations. Theory and Applications of Models of Computation (pp. 38\u201349). Singapore: Springer."},{"key":"9722_CR29","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., & Zhu, Z.A. (2010). Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce. EC \u201910, pp. 315\u2013324. Association for Computing Machinery, New York.","DOI":"10.1145\/1807342.1807393"},{"key":"9722_CR30","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. COCOA\u201911, pp. 262\u2013271. Springer, Berlin.","DOI":"10.1007\/978-3-642-22616-8_21"},{"key":"9722_CR31","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. Theoretical Computer Science, 497, 154\u2013163.","journal-title":"Theoretical Computer Science"},{"key":"9722_CR32","doi-asserted-by":"crossref","unstructured":"Zou, S., & Li, M. (2015). Facility location games with dual preference. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. AAMAS \u201915, pp. 615\u2013623. International Foundation for Autonomous Agents and Multiagent Systems, Richland.","DOI":"10.65109\/MZYJ6728"},{"key":"9722_CR33","unstructured":"Feigenbaum, I., & Sethuraman, J. (2015). Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. In: Workshops at the Twenty-ninth AAAI Conference on Artificial Intelligence. AAAI\u201915, pp. 8\u201313. AAAI Press, Texas."},{"issue":"1","key":"9722_CR34","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1609\/aaai.v29i1.9307","volume":"29","author":"P Serafino","year":"2015","unstructured":"Serafino, P., & Ventre, C. (2015). Truthful mechanisms without money for non-utilitarian heterogeneous facility location. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1), 1029\u20131035.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"9722_CR35","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. Theoretical Computer Science, 636, 27\u201346.","journal-title":"Theoretical Computer Science"},{"key":"9722_CR36","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.tcs.2020.10.004","volume":"847","author":"Z Chen","year":"2020","unstructured":"Chen, Z., Fong, K. C. K., Li, M., Wang, K., Yuan, H., & Zhang, Y. (2020). Facility location games with optional preference. Theoretical Computer Science, 847, 185\u2013197.","journal-title":"Theoretical Computer Science"},{"key":"9722_CR37","doi-asserted-by":"crossref","unstructured":"Li, M., Lu, P., Yao, Y., & Zhang, J. (2021). Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI\u201920. International Joint Conferences on Artificial Intelligence, Yokohama.","DOI":"10.24963\/ijcai.2020\/34"},{"key":"9722_CR38","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"},{"issue":"1","key":"9722_CR39","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1609\/aaai.v32i1.11458","volume":"32","author":"CKK Fong","year":"2018","unstructured":"Fong, C. K. K., Li, M., Lu, P., Todo, T., & Yokoo, M. (2018). Facility location games with fractional preferences. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1), 1039\u20131046.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"9722_CR40","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: Zhou, Z.-H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence Survey Track. IJCAI\u201921, pp. 4356\u20134365. International Joint Conferences on Artificial Intelligence Organization, Montreal-themed virtual reality.","DOI":"10.24963\/ijcai.2021\/596"}],"updated-by":[{"DOI":"10.1007\/s10458-026-09746-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000}}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-025-09722-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-025-09722-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-025-09722-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T07:30:18Z","timestamp":1775806218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-025-09722-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9722"],"URL":"https:\/\/doi.org\/10.1007\/s10458-025-09722-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,13]]},"assertion":[{"value":"17 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10458-026-09746-8","URL":"https:\/\/doi.org\/10.1007\/s10458-026-09746-8","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials availability"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"The authors declare no competing interests.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"41"}}