Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules

Details Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules

2011-08-22

arxiv.org/abs/1108.4436v2

Computer Science

Computational Complexity

9 pages, to appear in Information Processing Letters

Scientific paper

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1] proved a result that is only one step away from a full dichotomy of this problem for the important class of pure scoring rules in the case of unweighted voters and an unbounded number of candidates: Possible Winner is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule with vector (2,1,...,1,0), but is solvable in polynomial time for plurality and veto. We take the final step to a full dichotomy by showing that Possible Winner is NP-complete also for the scoring rule with vector (2,1,...,1,0).

Affiliated with

Also associated with

No associations

Rating

Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules 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 Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66367