Anonymous user
Condorcet method: Difference between revisions
no edit summary
imported>James Green-Armytage |
No edit summary |
||
Line 62:
* '''Smith/Minimax''' restricts the Minimax algorithm to the Smith set.<sup>1</sup>
* '''[[Ranked Pairs]]''' (RP) or '''Tideman''' (named after [[Nicolaus Tideman]]) with variations such as '''[[Maximize Affirmed Majorities]]''' (MAM) and '''[[Maximum Majority Voting]]''' (MMV)<sup>1</sup>
* '''Schulze''' with several reformulations/variations, including '''Schwartz Sequential Dropping (SSD)''' and '''[[Schulze method|Cloneproof Schwartz Sequential Dropping]] (CSSD)'''<sup>1</sup>
* '''[[Approval-Condorcet Hybrids]]''', such as '''[[Definite Majority Choice]]''', use an [[Approval Cutoff]] to augment the Condorcet pair wise array. Many believe that such a method would make a good first-round public proposal.
Line 102:
=== Cloneproof Schwartz Sequential Dropping (CSSD) ===
The "[[Schulze method|Cloneproof Schwartz Sequential Dropping]]" (CSSD) method resolves votes as follows:
# First, determine the Schwartz set (the innermost unbeaten set). If no defeats exist among the Schwartz set, then its members are the winners (plural only in the case of a tie, which must be resolved by another method).
Line 196:
Condorcet voting is not currently used in government elections. However, it is starting to receive support in some public organizations. Organizations which currently use some variant of the Condorcet method are:
# The Debian project uses [[Schulze method|Cloneproof Schwartz Sequential Dropping]].
# The Software in the Public Interest project uses [[Schulze method|Cloneproof Schwartz Sequential Dropping]].
# The UserLinux project uses [[Schulze method|Cloneproof Schwartz Sequential Dropping]].
# The Free State Project uses a Condorcet method for choosing its target state
# The voting procedure for the uk.* hierarchy of Usenet
| |||