Jump to content

Dodgson's method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Glenn Runciter (talk | contribs) at 18:24, 12 September 2011 (Undid revision 450121449 by Glenn Runciter (talk)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 NP-hard problem.[1]

References

  1. ^ 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.