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

Artificial Intelligence, pp. 20-42, 2014.

Cited by: 27|Bibtex|Views16|DOI:https://doi.org/10.1016/j.artint.2014.07.005
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|www.sciencedirect.com

Abstract:

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 manipulato...More

Code:

Data:

Your rating :
0

 

Tags
Comments