A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this work we consider general facility location and social choice problems, in which sets of agents A and facilities F are located in a metric space, and our goal is to assign agents to facilities (as well as choose which facilities to open) in order to optimize the social cost. We form new algorithms to do this in the presence of only ordinal information, i.e., when the true costs or distances from the agents to the facilities are unknown, and only the ordinal preferences of the agents forarXiv:1805.03103v1 fatcat:hi4ciebu3jaqfdvt2r7epsqugm