[PDF][PDF] Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections.
ISAIM, 2018•isaim2018.cs.ou.edu
… (2014) analyzed shift bribery in terms of parameterized complexity. We study shift bribery
for four iterative voting systems that each proceed in rounds, eliminating after each round
the candidates performing worst: The system of Baldwin (1926) eliminates the candidates
with lowest Borda score and the system of Nanson (1882) eliminates the candidates whose
score is lower than the average Borda score, while the system of Hare (defined, eg, in the
book by Taylor (1995)) eliminates the candidates with lowest plurality score and the system …
for four iterative voting systems that each proceed in rounds, eliminating after each round
the candidates performing worst: The system of Baldwin (1926) eliminates the candidates
with lowest Borda score and the system of Nanson (1882) eliminates the candidates whose
score is lower than the average Borda score, while the system of Hare (defined, eg, in the
book by Taylor (1995)) eliminates the candidates with lowest plurality score and the system …
Abstract
We show that shift bribery is intractable for the voting systems of Hare, Coombs, Baldwin, and Nanson.
isaim2018.cs.ou.edu
以上显示的是最相近的搜索结果。 查看全部搜索结果