ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1707.01417
79
55
v1v2 (latest)

Robustness Among Multiwinner Voting Rules

5 July 2017
Robert Bredereck
Piotr Faliszewski
Andrzej Kaczmarczyk
R. Niedermeier
P. Skowron
Nimrod Talmon
ArXiv (abs)PDFHTML
Abstract

We investigate how robust are results of committee elections to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates in a single preference order is either that (1) at most one committee member can be replaced, or (2) it is possible that the whole committee can be replaced. We also show that the problem of computing the smallest number of swaps that lead to changing the election outcome is typically NP-hard, but there are natural FPT algorithms. Finally, for a number of rules we assess experimentally the average number of random swaps necessary to change the election result.

View on arXiv
Comments on this paper