 Dodgson's method

Part of the Politics series Electoral methods Singlewinner Multiplewinner  Proportional representation
 Partylist (open · closed · mixed · local)
 Single transferable vote
 CPOSTV
 Schulze STV
 Wright system
 Semiproportional representation
Proxy voting  Delegable proxy
 Delegated proxy
Random selection Social choice theory  Arrow's theorem
 Gibbard–Satterthwaite theorem
 Voting system criteria
Politics portal Dodgson's Method is a voting system proposed by Charles Dodgson.
Description
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 NPhard problem.^{[1]}
References
 ^ 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 electionrelated article is a stub. You can help Wikipedia by expanding it.  Proportional representation