Definite Majority Choice: Difference between revisions
Merge Pairwise Sorted Approval
(Update link to Rob LeGrand's online voting calculator) |
(Merge Pairwise Sorted Approval) |
||
Line 3:
See also [[Proposed Statutory Rules for DMC]].
It can be extended to use [[Range voting]] instead of [[Approval voting]] as its base: in that case, the method eliminates the least-rated candidate.
Its elimination logic is the same as [[Benham's method]], and the method can thus be thought of as a rated version of it.
== [[Range voting]] implementation ==
Line 37 ⟶ 39:
| 0 || 0 || 0 || 0 || 0 || 00
|}
== Alternative implementation ==
This implementation is called '''Pairwise Sorted Approval'''. It is the simplest of a class of [[Pairwise Sorted Methods]].
A voter ranks candidates, and specifies approval, either by using an [[Approval Cutoff]] or by ranking above and below a fixed approval cutoff rank.
To determine the winner,
# sort candidates in descending order of approval.
# For each candidate, move it higher in the list as long as it pairwise beats the next-higher candidate, and only after all candidates above it have moved upward as far as they can.
This procedure can be used to produce a social ordering. It finds the same winner as the Benham-form implementation.
== Properties ==
Line 46 ⟶ 60:
== Background ==
The name "DMC" was first suggested [http://lists.electorama.com/pipermail/election-methods-electorama.com/2005-March/015164.html here]. Equivalent methods have been suggested several times on the EM mailing list:
* The
* The Ranked Approval Voting
The [http://lists.electorama.com/pipermail/election-methods-electorama.com/2005-March/015144.html philosophical basis] of DMC is to eliminate candidates that the voters strongly agree should ''not'' win, using two strong measures, and choose the undefeated candidate from those remaining.
| |||