111
v1v2v3 (latest)

Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule

Algorithmic Game Theory (AGT), 2024
Main:2 Pages
12 Figures
Bibliography:1 Pages
1 Tables
Appendix:41 Pages
Abstract

We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size kk is selected from a set of candidates based on voters' ordinal preferences. We assume that voters and candidates are embedded on a line metric, and social cost is determined by the underlying metric distances.The distortion of a voting rule is the worst-case ratio between the social cost of the elected committee and an optimal committee. Previous work has focused on the qq-cost model, in which a voter's cost is given by the distance to their qqth closest committee member. Here, we study the additive cost, where a voter's cost is the sum of distances to all committee members.We introduce the Polar Comparison Rule and analyze its distortion under utilitarian additive cost. We show that it achieves a distortion of at most 2.332.33 for all committee sizes k>2k>2, improving upon the previously best-known upper bound of 33. Moreover, for k=2k=2 and k=3k=3, we establish tight distortion bounds of 2.412.41 and 2.332.33, respectively. We also derive lower bounds that depend on the parity of kk and analyze the behavior of distortion for small and large committee sizes. Finally, we extend our results to the egalitarian additive cost.

View on arXiv
Comments on this paper