Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners

Details Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners

2005-09-19

arxiv.org/abs/cs/0509061v3

Computer Science

Data Structures and Algorithms

Scientific paper

In the year 1876 the mathematician Charles Dodgson, who wrote fiction under the now more famous name of Lewis Carroll, devised a beautiful voting system that has long fascinated political scientists. However, determining the winner of a Dodgson election is known to be complete for the \Theta_2^p level of the polynomial hierarchy. This implies that unless P=NP no polynomial-time solution to this problem exists, and unless the polynomial hierarchy collapses to NP the problem is not even in NP. Nonetheless, we prove that when the number of voters is much greater than the number of candidates--although the number of voters may still be polynomial in the number of candidates--a simple greedy algorithm very frequently finds the Dodgson winners in such a way that it ``knows'' that it has found them, and furthermore the algorithm never incorrectly declares a nonwinner to be a winner.

Affiliated with

Also associated with

No associations

Rating

Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners 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 Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1375