Conference item
Social choice under metric preferences: scoring rules and STV
- Abstract:
- We consider voting under metric preferences: both voters and candidates are associated with points in a metric space, and each voter prefers candidates that are closer to her to ones that are further away. In this setting, it is often desirable to select a candidate that minimizes the sum of distances to the voters. However, common voting rules operate on voters' preference rankings and therefore may be unable to identify the best candidate. A relevant measure of the quality of a voting rule is then its distortion, defined as the worst-case ratio between the performance of a candidate selected by the rule and that of an optimal candidate. Anshelevich, Bhardwaj and Postl show that some popular rules such as Borda and Plurality do badly in this regard: their distortion scales linearly with the number of candidates. On the positive side, Anshelevich et al. identify a few voting rules whose distortion is bounded by a constant; however, these rules are rarely used in practice. In this paper, we analyze the distortion of two widely used (classes of) voting rules, namely, scoring rules and Single Transferable Vote (STV). We show that all scoring rules have super-constant distortion, answering a question that was left open by Anshelevich et al.; however, we identify a scoring rule whose distortion is asymptotically better than that of Plurality and Borda. For STV, we obtain an upper bound of O(log m), where m is the number of candidates, as well as a super-constant lower bound; thus, STV is a reasonable, though not a perfect rule from this perspective.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 282.2KB, Terms of use)
-
- Publication website:
- https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14645
Authors
- Publisher:
- AAAI Press
- Host title:
- Thirty-First AAAI Conference on Artificial Intelligence
- Pages:
- 706-712
- Publication date:
- 2017-02-10
- Acceptance date:
- 2016-11-11
- Event title:
- Thirty-First AAAI Conference on Artificial Intelligence
- Event location:
- San Francisco, California USA
- Event website:
- https://www.aaai.org/Conferences/AAAI/aaai17.php
- Event start date:
- 2017-02-04
- Event end date:
- 2017-02-09
- Language:
-
English
- Keywords:
- Pubs id:
-
738751
- Local pid:
-
pubs:738751
- Deposit date:
-
2021-04-17
Terms of use
- Copyright holder:
- Association for the Advancement of Artificial Intelligence
- Copyright date:
- 2017
- Rights statement:
- Copyright © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
- Notes:
- This paper was presented at the Thirty-First AAAI Conference on Artificial Intelligence, 4-9 February 2017, San Francisco, California, USA. This is the accepted manuscript version of the paper. The final version is available online from AAAI Press at: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14645
If you are the owner of this record, you can report an update to it here: Report update to this record