Approval Sorted Margins: Difference between revisions
m
no edit summary
(Change ScoreSm.py to ssmpr.py) |
mNo edit summary |
||
Line 1:
'''Approval Sorted Margins''' is a [[voting system]] developed by [[Forest Simmons]] that selects a single winner using votes that express preferences, combined with an explicit approval cutoff. Approval Sorted Margins creates a sorted list of winners. It is also known as "Marginal Ranked Approval Voting" (MRAV).
If there is a candidate who is preferred over the other candidates, when compared in turn with each of the others, Approval Sorted Margins guarantees that that candidate will win. Because of this property, Approval Sorted Margins is (by definition) a [[Condorcet method]]. If there is no such candidate, Approval Sorted Margins initializes a ranking in descending order of approval, then reverses out-of-order pairs with the least difference in approval until all pairs are in order. One could consider this a form of "middle-out" sorting.
| |||