2000 character limit reached
Strategyproof Facility Location for Three Agents on a Circle (1902.08070v2)
Published 21 Feb 2019 in cs.GT
Abstract: We consider the facility location problem in a metric space, focusing on the case of three agents. We show that selecting the reported location of each agent with probability proportional to the distance between the other two agents results in a mechanism that is strategyproof in expectation, and dominates the random dictator mechanism in terms of utilitarian social welfare. We further improve the upper bound for three agents on a circle to 7/6 (whereas random dictator obtains 4/3); and provide the first lower bounds for randomized strategyproof facility location in any metric space, using linear programming.