Pairwise Sorted Approval: Difference between revisions
Content added Content deleted
Psephomancy (talk | contribs) (Merge with DMC, says they are equivalent) |
Psephomancy (talk | contribs) (cat for ranked ballots) |
||
| Line 11: | Line 11: | ||
This procedure can be used to produce a social ordering. It finds the same winner as [[Definite Majority Choice]]. |
This procedure can be used to produce a social ordering. It finds the same winner as [[Definite Majority Choice]]. |
||
[[Category:Voting methods]] |
[[Category:Voting methods]] |
||
[[Category:Preferential voting methods]] |
|||
Revision as of 20:36, 9 August 2019
 | It has been suggested that this article be merged into Definite Majority Choice. (Discuss) Proposed since August 2019. |
Pairwise Sorted Approval 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,
- sorted 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 Definite Majority Choice.