@inproceedings{f7e81133bd884084b22ee58e00c7199e,
title = "Robustness among multiwinner voting rules",
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.",
author = "Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 10th International Symposium on Algorithmic Game Theory, SAGT 2017 ; Conference date: 12-09-2017 Through 14-09-2017",
year = "2017",
month = jan,
day = "1",
doi = "https://doi.org/10.1007/978-3-319-66700-3_7",
language = "American English",
isbn = "9783319666990",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "80--92",
editor = "Vittorio Bilo and Michele Flammini",
booktitle = "Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings",
address = "Germany",
}