Definite Majority Choice: Difference between revisions
Content added Content deleted
imported>Araucaria |
imported>Araucaria (Expanding, adding more cross references) |
||
Line 1: | Line 1: | ||
'''Definite Majority Choice''' (DMC) is a [[voting method]] proposed by several to select a single winner using ballots that express preferences, with an additional indication of Approval Cutoff. |
|||
== Definite Majority Choice == |
|||
If there is a candidate who is preferred over the other candidates, |
|||
⚫ | |||
when compared in turn with each of the others, DMC guarantees that that candidate will win. |
|||
Because of this property, DMC is (by definition) a '''[[Condorcet method]]'''. |
|||
Note that this is different from some other preference voting systems such as [[Borda count|Borda]] and |
|||
[[Instant-runoff voting]], which do not make this guarantee. |
|||
The main difference between DMC and other Condorcet methods such as [[Ranked Pairs]] (RP), [[Cloneproof Schwartz Sequential Dropping]] (Beatpath or Schulze) and [[River]] is the use of the additional Approval score to break ties. If defeat strength is measured by the Total Approval score of the pairwise winner, DMC is equiavent to each of these other methods [''This needs to be verified! --[[User:Araucaria|Araucaria]] 12:22, 21 Mar 2005 (PST)''] |
|||
⚫ | |||
DMC chooses the same winner as (and could be considered equivalent in most respects to) [[Ranked Approval Voting]] (RAV) (also known as Approval Ranked Concorcet), and [[Pairwise Sorted Approval]] (PSA). |
|||
⚫ | |||
== Procedure == |
|||
⚫ | |||
Graded rankings added into a Round-Robin array, and the approval |
Graded rankings added into a Round-Robin array, and the approval |
||
Line 9: | Line 21: | ||
To determine the winner: |
To determine the winner: |
||
# Eliminate any candidate that is defeated in a one-to-one match with any other higher-approved candidate. So by 2 different measures, a definite majority agrees that candidate should be eliminated. |
|||
#If more than one candidate remains, the winner is the single candidate that defeats all others in one-to-one (pairwise)contests. |
|||
One implementation of Definite Majority Choice might use a [[Graded Ballot]] with a Lowest Passing Grade option: |
One implementation of Definite Majority Choice might use a [[Graded Ballot]] with a Lowest Passing Grade option: |
||
Line 49: | Line 61: | ||
In that case, form the superset '''P*''', the union of all sets P that result from all possible combinations of reversed ties or near-ties. Then choose the winner from P* using [http://wiki.electorama.com/wiki/Techniques_of_method_design#Orderings Random Ballot Order]. |
In that case, form the superset '''P*''', the union of all sets P that result from all possible combinations of reversed ties or near-ties. Then choose the winner from P* using [http://wiki.electorama.com/wiki/Techniques_of_method_design#Orderings Random Ballot Order]. |
||
[[Category:Condorcet method]] |