Complexity of and Algorithms for Borda Manipulation

Details Complexity of and Algorithms for Borda Manipulation Complexity of and Algorithms for Borda Manipulation

2011-05-27

arxiv.org/abs/1105.5667v1

Computer Science

Artificial Intelligence

Scientific paper

We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin packing and multiprocessor scheduling, we propose two new approximation methods to compute manipulations of the Borda rule. Experiments show that these methods significantly outperform the previous best known %existing approximation method. We are able to find optimal manipulations in almost all the randomly generated elections tested. Our results suggest that, whilst computing a manipulation of the Borda rule by a coalition is NP-hard, computational complexity may provide only a weak barrier against manipulation in practice.

Affiliated with

Also associated with

No associations

Rating

Complexity of and Algorithms for Borda Manipulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of and Algorithms for Borda Manipulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of and Algorithms for Borda Manipulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49469