Abstract
We address the problem of strategyproof (SP) facility location mechanisms on discrete trees. Our main result is a full characterization of onto and SP mechanisms. In particular, we prove that when a single agent significantly affects the outcome, the trajectory of the facility is almost contained in the trajectory of the agent, and both move in the same direction along the common edges. We show tight relations of our characterization to previous results on discrete lines and on continuous trees. We then derive further implications of the main result for infinite discrete lines.
Similar content being viewed by others
Notes
Intuitively, consistency means that projecting on different pairs of vertices should not yield contradicting outcomes. We omit the exact definition since it is not relevant for our purpose.
This is different from the tree monotonicity property in [29].
This property is sometimes called “tops-only" or “peaks-only”.
References
Alon, N., Feldman, M., Procaccia, A. D., & Tennenholtz, M. (2010). Strategyproof approximation of the minimax on networks. Mathematics of Operations Research, 35(3), 513–526.
Anastasiadis, E., & Deligkas, A. (2018). Heterogeneous facility location games. In: The 17th International conference on autonomous agents and multiagent systems (AAMAS’18).
Barbera, S., & Peleg, B. (1990). Strategy-proof voting schemes with continuous preferences. Social Choice and Welfare, 7(1), 31–38.
Black, D. (1948). On the rationale of group decision-making. Journal of Political Economy, 56(1), 23–34.
Border, K. C., & Jordan, J. S. (1983). Straightforward elections, unanimity and phantom voters. The Review of Economic Studies, 50(1), 153–170.
Chan, H., Filos-Ratsikas, A., Li, B., Li, M., & Wang, C. (2021). Mechanism design for facility location problems: A survey. arXiv preprint arXiv:2106.03457.
Chen, X., Fang, Q., Liu, W., & Ding, Y. (2020). Strategyproof mechanisms for 2-facility location games with minimax envy. In: International conference on algorithmic applications in management, pp. 260–272. Springer.
Chen, Z., Fong, K. C., Li, M., Wang, K., Yuan, H., & Zhang, Y. (2020). Facility location games with optional preference. Theoretical Computer Science, 847, 185–197.
Cheng, Y., Yu, W., & Zhang, G.(2011). Mechanisms for obnoxious facility game on a path. In: International conference on combinatorial optimization and applications, pp. 262–271. Springer.
Cheng, Y., Yu, W., & Zhang, G. (2013). Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoretical Computer Science, 497, 154–163.
De Keijzer, B., & Wojtczak, D. (2022). Facility reallocation on the line. Algorithmica, 84(10), 2898–2925.
Deligkas, A., Filos-Ratsikas, A., & Voudouris, A. A. (2022). Heterogeneous facility location with limited resources. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 5, pp. 4966–4974.
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, pp. 423–440.
Duan, L., Li, B., Li, M., & Xu, X. (2019) Heterogeneous two-facility location games with minimum distance requirement. In: The 18th international conference on autonomous agents and multiagent systems (AAMAS’19), pp. 1461–1469.
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–286. ACM.
Feldman, M., & Wilf, Y. (2013). Strategyproof facility location and the least squares objective. In: Proceedings of the fourteenth ACM conference on Electronic commerce, pp. 873–890.
Filimonov, A., & Meir, R. (2021). Strategyproof facility location mechanisms on discrete trees. In: Proceedings of the 20th international conference on autonomous agents and multiagent systems, AAMAS ’21, pp. 510–518.
Filos-Ratsikas, A., Voudouris, & A.A. (2021). Approximate mechanism design for distributed facility location. In: International symposium on algorithmic game theory, pp. 49–63. Springer.
Fong, K.C., Li, M., Lu, P., Todo, T., & Yokoo, M. (2018). Facility location games with fractional preferences. In: 32nd AAAI conference on artificial intelligence, AAAI 2018, pp. 1039–1046. AAAI Press.
Fotakis, D., Kavouras, L., Kostopanagiotis, P., Lazos, P., Skoulakis, S., & Zarifis, N. (2021). Reallocating multiple facilities on the line. Theoretical Computer Science, 858, 13–34.
Fotakis, D., & Patsilinakos, P. (2021) Strategyproof facility location in perturbation stable instances. In: International conference on web and internet economics, pp. 95–112. Springer.
Fotakis, D., & Tzamos, C. (2014). On the power of deterministic mechanisms for facility location games. ACM Transactions on Economics and Computation (TEAC), 2(4), 1–37.
Ibara, K., & Nagamochi, H. (2012). Characterizing mechanisms in obnoxious facility game. In: International conference on combinatorial optimization and applications, pp. 301–311. Springer.
Kyropoulou, M., Ventre, C., & Zhang, X. (2019). Mechanism design for constrained heterogeneous facility location. In: International symposium on algorithmic game theory, pp. 63–76. Springer.
Liu, W., Ding, Y., Chen, X., Fang, Q., & Nong, Q. (2020). Multiple facility location games with envy ratio. In: International conference on algorithmic applications in management, pp. 248–259. Springer.
Meir, R. (2019). Strategyproof facility location for three agents on a circle. In: International symposium on algorithmic game theory, pp. 18–33. Springer.
Moulin, H. (1980). On strategy-proofness and single peakedness. Public Choice, 35(4), 437–455.
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, pp. 1452–1460.
Peters, H., Roy, S., & Sadhukhan, S. (2019) Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs. Tech. rep., Working Paper.
Procaccia, A.D., & Tennenholtz, M. (2009) Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on Electronic commerce, pp. 177–186.
Roy, S., & Storcken, T. (2019). A characterization of possibility domains in strategic voting. Journal of Mathematical Economics, 84, 46–55.
Schummer, J., & Vohra, R. V. (2002). Strategy-proof location on a network. Journal of Economic Theory, 104(2), 405–428.
Tang, Z.Z., Wang, C.H., Zhang, M.Q., & Zhao, Y.C. (2022) Strategyproof facility location with limited locations. Journal of the Operations Research Society of China pp. 1–15.
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 (AAMAS’11), pp. 651–658.
Todo, T., Okada, N., & Yokoo, M. (2019) False-name-proof facility location on discrete structures. arXiv preprint arXiv:1907.08914.
Wada, Y., Ono, T., Todo, T., & Yokoo, M. (2018) Facility location with variable and dynamic populations. In: The 17th International conference on autonomous agents and multiagent systems (AAMAS’18), pp. 336–344.
Xu, X., Li, M., & Duan, L. (2020) Strategyproof mechanisms for activity scheduling. In: The 19th international conference on autonomous agents and multiagent systems (AAMAS’20), pp. 1539–1547.
Acknowledgement
This research was supported by the Israel Science Foundation (ISF; Grant No. 2539/20).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Filimonov, A., Meir, R. Strategyproof facility location mechanisms on discrete trees. Auton Agent Multi-Agent Syst 37, 10 (2023). https://doi.org/10.1007/s10458-022-09592-4
Accepted:
Published:
DOI: https://doi.org/10.1007/s10458-022-09592-4