Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules

@article{Davies2014ComplexityOA,
  title={Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules},
  author={Jessica Davies and George Katsirelos and Nina Narodytska and Toby Walsh and Lirong Xia},
  journal={Artif. Intell.},
  year={2014},
  volume={217},
  pages={20-42}
}
We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standing open problem in the computational complexity of manipulating common voting rules. We prove that… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 40 references