Dodgson's method

Dodgson's method is an electoral system based on a proposal by mathematician Charles Dodgson, better known as Lewis Carroll. The method searches for a majority-preferred winner; if no such winner is found, the method proceeds by finding the candidate who could be transformed into a Condorcet winner with the smallest number of ballot edits possible, where a ballot edit switches two neighboring candidates on a voter's ballot.^[1]

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 in each ballot (added over all candidates) before they become a Condorcet winner.

Computation

In short, we must find the voting profile with minimum Kendall tau distance from the input, such that it has a Condorcet winner; then, the Condorcet winner is declared the victor. Computing the winner or even the Dodgson score of a candidate (the number of swaps needed to make that candidate a winner) is an NP-hard problem^[2] by reduction from Exact Cover by 3-Sets (X3C).^[3]

Given an integer k and an election, it is NP-complete to determine whether a candidate can become a Condorcet winner with fewer than k swaps.

References

^ Ratliff, Thomas C. (2001-01-01). "A comparison of Dodgson's method and Kemeny's rule". Social Choice and Welfare. 18 (1): 79–89. doi:10.1007/s003550000060. ISSN 1432-217X.
^ Bartholdi, J.; Tovey, C. A.; Trick, M. A. (April 1989). "Voting schemes for which it can be difficult to tell who won the election". Social Choice and Welfare. 6 (2): 157–165. doi:10.1007/BF00303169. S2CID 154114517. The article only directly proves NP-hardness, but it is clear that the decision problem is in NP since given a candidate and a list of k swaps, you can tell whether that candidate is a Condorcet winner in polynomial time.
^ Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability. W.H. Freeman Co., San Francisco. ISBN 9780716710455.

This election-related article is a stub. You can help Wikipedia by expanding it.

[1] Ratliff, Thomas C. (2001-01-01). "A comparison of Dodgson's method and Kemeny's rule". Social Choice and Welfare. 18 (1): 79–89. doi:10.1007/s003550000060. ISSN 1432-217X.

[btt-2] Bartholdi, J.; Tovey, C. A.; Trick, M. A. (April 1989). "Voting schemes for which it can be difficult to tell who won the election". Social Choice and Welfare. 6 (2): 157–165. doi:10.1007/BF00303169. S2CID 154114517. The article only directly proves NP-hardness, but it is clear that the decision problem is in NP since given a candidate and a list of k swaps, you can tell whether that candidate is a Condorcet winner in polynomial time.

[gj1979-3] Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability. W.H. Freeman Co., San Francisco. ISBN 9780716710455.

[1]

[2]

[3]