{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T14:45:31Z","timestamp":1744296331048,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10458-022-09563-9","type":"journal-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T08:04:00Z","timestamp":1654157040000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Budget feasible mechanisms for facility location games with strategic facilities"],"prefix":"10.1007","volume":"36","author":[{"given":"Minming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2481-5648","authenticated-orcid":false,"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengqi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,2]]},"reference":[{"key":"9563_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., & Markakis, E. (2017). On budget-feasible mechanism design for symmetric submodular objectives. In Proceedings of the 13th international conference on web and internet economics (WINE), pp. 1\u201315.","DOI":"10.1007\/978-3-319-71924-5_1"},{"key":"9563_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., & Tardos, \u00c9. (2001). Truthful mechanisms for one-parameter agents. In Proceedings 42nd IEEE symposium on foundations of computer science (FOCS), pp. 482\u2013491.","DOI":"10.1109\/SFCS.2001.959924"},{"key":"9563_CR3","unstructured":"Aziz, H., Chan, H., Lee, B.E., & Parkes, D.C. (2019). The capacity constrained facility location problem. In Proceedings of the 15th international conference on web and internet economics (WINE), pp. 336."},{"issue":"2","key":"9563_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2841227","volume":"4","author":"M Babaioff","year":"2016","unstructured":"Babaioff, M., Feldman, M., & Tennenholtz, M. (2016). Mechanism design with strategic mediators. ACM Transactions on Economics and Computation, 4(2), 1\u201348.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9563_CR5","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Garimidi, P., Gkatzelis, V., Schoepflin, D., & Tan, X. (2022). Deterministic budget-feasible clock auctions. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2940\u20132963.","DOI":"10.1137\/1.9781611977073.114"},{"key":"9563_CR6","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Gravin, N., & Lu, P. (2012). Budget feasible mechanism design: from prior-free to bayesian. In Proceedings of the 44th annual ACM symposium on theory of computing (STOC), pp. 449\u2013458.","DOI":"10.1145\/2213977.2214020"},{"key":"9563_CR7","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 Proceedings of the 30th international joint conference on artificial intelligence (IJCAI), pp. 4356\u20134365.","DOI":"10.24963\/ijcai.2021\/596"},{"key":"9563_CR8","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., & Lu, P. (2011). On the approximability of budget feasible mechanisms. In Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (SODA), pp. 685\u2013699.","DOI":"10.1137\/1.9781611973082.54"},{"key":"9563_CR9","unstructured":"Chen, X., Li, M., Wang, C., Wang, C., & Zhao, Y. (2019). Truthful mechanisms for location games of dual-role facilities. In Proceedings of the 18th international conference on autonomous agents and multiagent systems (AAMAS), pp. 1470\u20131478."},{"key":"9563_CR10","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., Wei, Yu., & 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"},{"issue":"2","key":"9563_CR11","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 $$l_p$$ norm of costs. Mathematics of Operations Research, 42(2), 434\u2013447.","journal-title":"Mathematics of Operations Research"},{"key":"9563_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., & Golomb, I. (2016). On voting and facility location. In Proceedings of the 17th ACM conference on economics and computation (EC), pp. 269\u2013286.","DOI":"10.1145\/2940716.2940725"},{"key":"9563_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, M. & Wilf Y. (2013). Strategyproof facility location and the least squares objective. In Proceedings of the 14th ACM conference on electronic commerce (EC), pp. 873\u2013890.","DOI":"10.1145\/2482540.2482543"},{"issue":"6","key":"9563_CR14","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"},{"issue":"4","key":"9563_CR15","doi-asserted-by":"publisher","first-page":"15","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, 2(4), 15.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9563_CR16","doi-asserted-by":"crossref","unstructured":"Jalaly\u00a0Khalilabadi, P. & Tardos, \u00c9. (2018). Simple and efficient budget feasible mechanisms for monotone submodular valuations. In Proceedings of the 14th international conference on web and internet economics (WINE), pp. 246\u2013263.","DOI":"10.1007\/978-3-030-04612-5_17"},{"key":"9563_CR17","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Monaco, G., Sankowski, P., & Zhang, Q. (2017). Budget feasible mechanisms on matroids. In International conference on integer programming and combinatorial optimization, pp. 368\u2013379.","DOI":"10.1007\/978-3-319-59250-3_30"},{"key":"9563_CR18","doi-asserted-by":"crossref","unstructured":"Li, M., Wang, C., & Zhang, M. (2020). Budgeted facility location games with strategic facilities. In Proceedings of the 29th international joint conference on artificial intelligence (IJCAI), pp. 400\u2013406.","DOI":"10.24963\/ijcai.2020\/56"},{"key":"9563_CR19","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), pp. 315\u2013324.","DOI":"10.1145\/1807342.1807393"},{"issue":"4","key":"9563_CR20","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":"1","key":"9563_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6(1), 58\u201373.","journal-title":"Mathematics of Operations Research"},{"issue":"1\u20132","key":"9563_CR22","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., & Ronen, A. (2001). Algorithmic mechanism design. Games and Economic Behavior, 35(1\u20132), 166\u2013196.","journal-title":"Games and Economic Behavior"},{"key":"9563_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic game theory. Cambridge: Cambridge University Press."},{"key":"9563_CR24","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"},{"issue":"2","key":"9563_CR25","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. V. (2002). Strategy-proof location on a network. Journal of Economic Theory, 104(2), 405\u2013428.","journal-title":"Journal of Economic Theory"},{"key":"9563_CR26","doi-asserted-by":"crossref","unstructured":"Paolo, S. & Ventre, C. (2015). Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In Proceedings of the 29th conference on artificial intelligence (AAAI), pp. 1029\u20131035.","DOI":"10.1609\/aaai.v29i1.9307"},{"issue":"1","key":"9563_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-019-09435-9","volume":"34","author":"P Serafino","year":"2020","unstructured":"Serafino, P., Ventre, C., & Vidali, A. (2020). Truthfulness on a budget: trading money for approximation through monitoring. Autonomous Agents and Multi-Agent Systems, 34(1), 1\u201324.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9563_CR28","doi-asserted-by":"crossref","unstructured":"Singer, Y. (2010). Budget feasible mechanisms. In Proceedings 51st IEEE symposium on foundations of computer science (FOCS), pp. 765\u2013774.","DOI":"10.1109\/FOCS.2010.78"},{"key":"9563_CR29","unstructured":"Wada, Y., Ono, T., Todo, T., & Yokoo, M. (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":"9563_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C. (1977). Probabilistic computations: Toward a unified measure of complexity. In Proceedings 18th IEEE symposium on foundations of computer science (FOCS), pp. 222\u2013227.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09563-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09563-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T12:49:14Z","timestamp":1667047754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09563-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9563"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09563-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2022,6,2]]},"assertion":[{"value":"3 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"35"}}