Eliminating the Weakest Link: Making Manipulation Intractable?

Details Eliminating the Weakest Link: Making Manipulation Intractable? Eliminating the Weakest Link: Making Manipulation Intractable?

2012-04-17

arxiv.org/abs/1204.3918v1

Computer Science

Artificial Intelligence

To appear in Proceedings of Twenty-Sixth Conference on Artificial Intelligence (AAAI-12)

Scientific paper

Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting rules used in practice, the computational complexity increases. For example, it is already known that it is NP-hard to compute how a single voter can manipulate the result of single transferable voting (the elimination version of plurality voting). We show here that it is NP-hard to compute how a single voter can manipulate the result of the elimination version of veto voting, of the closely related Coombs' rule, and of the elimination versions of a general class of scoring rules.

Affiliated with

Also associated with

No associations

Rating

Eliminating the Weakest Link: Making Manipulation Intractable? 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 Eliminating the Weakest Link: Making Manipulation Intractable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eliminating the Weakest Link: Making Manipulation Intractable? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410679