Sequential pairwise elimination: Difference between revisions
m
no edit summary
(Forest clarified that SPE works in reverse order of the base method. I've updated the description and example to reflect that.) |
mNo edit summary |
||
Line 3:
An SPE method, emulating legislative procedure, works by first determining a base social order by some method (e.g. [[Minmax]] or [[Range]]). Then starting with the loser of that order (or list), compare the current candidate at the end of the list with the candidate next to it. Replace the two adjacent candidates in the list with the candidate who beats the other pairwise, then repeat. The candidate who is left standing at the end is the winner.
In effect, each candidate can be considered a proposal (a bill or an amendment).
==Example==
| |||