Bi-Criteria Metric Distortion
Preprint
Abstract
Selecting representatives based on voters' preferences is a fundamental problem in social choice theory. While cardinal utility functions offer a detailed representation of preferences, ordinal rankings are often the only available information due to their simplicity and practical constraints. The metric distortion framework addresses this issue by modeling voters and candidates as points in a metric space, with distortion quantifying the efficiency loss from relying solely on ordinal rankings. Existing works define the cost of a voter with respect to a candidate as their distance and set the overall cost as either the sum (utilitarian) or maximum (egalitarian) of these costs across all voters. They show that deterministic algorithms achieve a best-possible distortion of 3 for any metric when considering a single candidate. This paper explores whether one can obtain a better approximation compared to an optimal candidate by relying on a committee of $k$ candidates ($k \ge 1$), where the cost of a voter is defined as its distance to the closest candidate in the committee. We answer this affirmatively in the case of line metrics, demonstrating that with $O(1)$ candidates, it is possible to achieve optimal cost. Our results extend to both utilitarian and egalitarian objectives, providing new upper bounds for the problem. We complement our results with lower bounds for both the line and 2-D Euclidean metrics.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- The Condorcet dimension of metric spacesOperations Research Letters, 2025
- Six Candidates Suffice to Win a Voter Majority2025
- The metric distortion of multiwinner votingArtificial Intelligence, 2022
- Plurality Veto: A Simple Voting Rule Achieving Optimal Metric Distortion2022
- Approximating optimal social choice under metric preferencesArtificial Intelligence, 2018
- Properties of multiwinner voting rulesSocial Choice and Welfare, 2017
- Condorcet winning setsSocial Choice and Welfare, 2014
- Approximation Algorithms for Metric Facility Location ProblemsSIAM Journal on Computing, 2006