The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting …
We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance …
Aggregating the preferences of individuals into a collective decision is the core subject of study of social choice theory. In 2006, Procaccia and Rosenschein considered a utilitarian …
D Kempe - Proceedings of the AAAI Conference on Artificial …, 2020 - aaai.org
In distortion-based analysis of social choice rules over metric spaces, voters and candidates are jointly embedded in a metric space. Voters rank candidates by non-decreasing distance …
M Schulze - arXiv preprint arXiv:1804.02973, 2018 - arxiv.org
We propose a new single-winner election method (" Schulze method") and prove that it satisfies many academic criteria (eg monotonicity, reversal symmetry, resolvability …
E Anshelevich, W Zhu - ACM Transactions on Economics and …, 2021 - dl.acm.org
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 …
Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of n agents located in an underlying metric …
We develop new voting mechanisms for the case where voters and candidates are located in an arbitrary unknown metric space, and the goal is to choose a candidate minimizing …
In this work, we study the metric distortion problem in voting theory under a limited amount of ordinal information. Our primary contribution is threefold. First, we consider mechanisms that …