|Part of the Politics series|
Dodgson's method is a voting system proposed by the author, mathematician and logician, Charles Dodgson (better known as Lewis Carroll). The method is extending the Condorcet method by swapping candidates until you find a Condorcet winner. The winner is the candidate which requires the minimum number of swaps. Dodgson proposed this voting scheme in his 1876 work "A method of taking votes on more than two issues". Given an integer k and an election, it is NP-complete to determine whether or not a candidate can become a Condorcet winner with less than k swaps.
In Dodgson's method, each voter submits an ordered list of all candidates according to their own preference (from best to worst). The winner is defined to be the candidate for whom we need to perform the minimum number of pairwise swaps (added over all candidates) before they become a Condorcet winner. In particular, if there is already a Condorcet winner, they win the election.
In short, we must find the voting profile with minimum Kendall tau distance from the input, such that it has a Condorcet winner; they are declared the victor. Computing the winner is an NP-hard problem.
- J. Bartholdi III, C. A. Tovey, and M. A. Trick, "Voting schemes for which it can be difficult to tell who won the election", Social Choice and Welfare, Vol. 6, No. 2 (1989), pp. 157–165.
|This election-related article is a stub. You can help Wikipedia by expanding it.|