Condorcet method: Difference between revisions
m
Mentioned that Condorcet can be done on rated ballots, added Smith//Score as a Condorcet method, and made some other minor changes.
Psephomancy (talk | contribs) No edit summary |
m (Mentioned that Condorcet can be done on rated ballots, added Smith//Score as a Condorcet method, and made some other minor changes.) |
||
Line 12:
== Casting ballots ==
Each voter fills out a [[preferential voting|ranked ballot]]
== Counting ballots ==
Ballots are counted by considering all possible sets of two-candidate elections from all available candidates.
If a candidate is preferred over all other candidates, that candidate is the [[Condorcet
=== Counting with matrices ===
Line 66:
* '''[[Schulze method|Schulze]]''' with several reformulations/variations, including '''Schwartz Sequential Dropping (SSD)''' and '''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.
*'''[[Smith//Score]]''' chooses the candidate with the highest summed or average score in the Smith Set.
<sup>1</sup> There are different ways to measure the strength of each defeat in some methods. Some use the margin of defeat (the difference between votes for and votes against), while others use winning votes (the votes favoring the defeat in question).
|