{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:25:20Z","timestamp":1773617120256,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T00:00:00Z","timestamp":1697760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T00:00:00Z","timestamp":1697760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10458-023-09624-7","type":"journal-article","created":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:02:51Z","timestamp":1697792571000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A family of strategyproof mechanisms for activity scheduling"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9661-5357","authenticated-orcid":false,"given":"Xinping","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingjie","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,20]]},"reference":[{"key":"9624_CR1","unstructured":"Anastasiadis, E., & Deligkas, A. (2018). Heterogeneous facility location games. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 623\u2013631."},{"key":"9624_CR2","doi-asserted-by":"crossref","unstructured":"Chan, H., Filos-Ratsikas, A., Li, B., et\u00a0al. (2021). Mechanism design for facility location problem: A survey. In: The 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), pp. 1\u201317.","DOI":"10.24963\/ijcai.2021\/596"},{"key":"9624_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Yu, W., & Zhang, G. (2011). Mechanisms for obnoxious facility game on a path. In: International Conference on Combinatorial Optimization and Applications (COCOA), Springer, pp. 262\u2013271.","DOI":"10.1007\/978-3-642-22616-8_21"},{"key":"9624_CR12","doi-asserted-by":"crossref","unstructured":"de\u00a0Keijzer, B., & Wojtczak, D. (2018). Facility reallocation on the line. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 188\u2013194.","DOI":"10.24963\/ijcai.2018\/26"},{"key":"9624_CR4","unstructured":"Duan, L., Li, B., Li, M., et\u00a0al. (2019). Heterogeneous two-facility location games with minimum distance requirement. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 1461\u20131469."},{"key":"9624_CR5","unstructured":"Feigenbaum, I., & Sethuraman, J. (2015). Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. In: Workshop on Incentive and Trust in E-Communities at the 29th AAAI Conference on Artificial Intelligence (AAAI)."},{"issue":"6","key":"9624_CR6","first-page":"1209","volume":"31","author":"A Filos-Ratsikas","year":"2017","unstructured":"Filos-Ratsikas, A., Li, M., Zhang, J., et al. (2017). Facility location with double-peaked preferences, 31(6), 1209\u20131235.","journal-title":"Facility location with double-peaked preferences"},{"key":"9624_CR7","doi-asserted-by":"crossref","unstructured":"Fong, K.C., Li, M., Lu, P., et\u00a0al. (2018). Facility location games with fractional preferences. In: Proceedings of the 32th AAAI Confererence on Artificial Intelligence (AAAI).","DOI":"10.1609\/aaai.v32i1.11458"},{"key":"9624_CR8","volume-title":"Moneyless Strategy-proof Mechanism on Single-sinked Policy Domain: Characterization and Applications","author":"Q Han","year":"2011","unstructured":"Han, Q., & Du, D. (2011). Moneyless Strategy-proof Mechanism on Single-sinked Policy Domain: Characterization and Applications. Faculty of Business Administration: University of New Brunswick."},{"key":"9624_CR9","unstructured":"Hassani, S. (1999). Dirac delta function. In: Mathematical Physics: A Modem Introduction to Its Foundations. Springer, pp. 159\u2013171."},{"issue":"2","key":"9624_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/71.265940","volume":"5","author":"ES Hou","year":"1994","unstructured":"Hou, E. S., Ansari, N., & Ren, H. (1994). A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems, 5(2), 113\u2013120.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9624_CR11","doi-asserted-by":"crossref","unstructured":"Ibara, K., & Nagamochi, H. (2012). Characterizing mechanisms in obnoxious facility game. In: Proceedings of the 6th International Conference on Combinatorial Optimization and Applications (COCOA), Springer, pp. 301\u2013311.","DOI":"10.1007\/978-3-642-31770-5_27"},{"key":"9624_CR13","doi-asserted-by":"crossref","unstructured":"Lu, P., Wang, Y., & Zhou, Y. (2009). Tighter bounds for facility games. In: Proceedings of the 6th International Workshop on Internet and Network Economics (WINE), Springer, pp. 137\u2013148.","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"9624_CR14","first-page":"44","volume":"1","author":"L Ozdamar","year":"1999","unstructured":"Ozdamar, L. (1999). A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems Man and Cybernetics Part C Applications and Reviews, 1, 44\u201359.","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part C Applications and Reviews"},{"key":"9624_CR15","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., & Tennenholtz, M. (2009). Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on Electronic commerce, pp. 177\u2013186.","DOI":"10.1145\/1566374.1566401"},{"key":"9624_CR16","unstructured":"Serafino, P., & Ventre, C. (2014). Heterogeneous facility location without money on the line. In: Proceedings of the 21st European Conference on Artificial Intelligence (ECAI), pp. 807\u2013812."},{"key":"9624_CR17","unstructured":"Stankovic, J.A., Spuri, M., & Ramamritham, K., et\u00a0al. (2012) Deadline scheduling for real-time systems: EDF and related algorithms, Vol 460. Springer Science & Business Media."},{"key":"9624_CR18","unstructured":"Sui, X., Boutilier, C., & Sandholm, T.W. (2013). Analysis and optimization of multi-dimensional percentile mechanisms. In: Proceedings of the 27th AAAI Confererence on Artificial Intelligence (AAAI), pp. 367\u2013374."},{"key":"9624_CR19","unstructured":"Todo, T., Iwasaki, A., Yokoo, M. (2011). False-name-proof mechanism design without money. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems-Volume 2 (AAMAS), pp. 651\u2013658."},{"key":"9624_CR20","unstructured":"Wada, Y., Ono, T., Todo, T., et\u00a0al. (2018). Facility location with variable and dynamic populations. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 336\u2013344."},{"key":"9624_CR21","unstructured":"Xu, X., Li, M., & Duan, L. (2020) Strategyproof mechanisms for activity scheduling. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 1539\u20131547."},{"key":"9624_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., et al. (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":"3","key":"9624_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.dss.2007.08.001","volume":"44","author":"IT Yang","year":"2008","unstructured":"Yang, I. T. (2008). Utility-based decision support system for schedule optimization. Decision Support Systems, 44(3), 595\u2013605.","journal-title":"Decision Support Systems"},{"key":"9624_CR24","doi-asserted-by":"crossref","unstructured":"Ye, D., Mei, L., & Zhang, Y. (2015). Strategy-proof mechanism for obnoxious facility location on a line. In: Proceedings of the 21th International Computing and Combinatorics Conference (COCOON), Springer, pp. 45\u201356","DOI":"10.1007\/978-3-319-21398-9_4"},{"key":"9624_CR25","unstructured":"Yuan, H., Wang, K., Fong, K.C., et\u00a0al. (2016). Facility location games with optional preference. In: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI), pp. 1520\u20131527."},{"issue":"4","key":"9624_CR26","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. Journal of Combinatorial Optimization, 28(4), 756\u2013773.","journal-title":"Journal of Combinatorial Optimization"},{"key":"9624_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 (AAMAS), pp. 615\u2013623."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09624-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-023-09624-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09624-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T04:56:02Z","timestamp":1702875362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-023-09624-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9624"],"URL":"https:\/\/doi.org\/10.1007\/s10458-023-09624-7","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,20]]},"assertion":[{"value":"7 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"44"}}