Strategyproof Facility Location Mechanisms on Discrete Trees
Computer Science and Game Theory
2021-02-05 v1
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.
Cite
@article{arxiv.2102.02610,
title = {Strategyproof Facility Location Mechanisms on Discrete Trees},
author = {Alina Filimonov and Reshef Meir},
journal= {arXiv preprint arXiv:2102.02610},
year = {2021}
}
Comments
Accepted to the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-21)