Approval Sorted Margins: Difference between revisions
m
Fixed link
m (Add Condorce-cardinal hybrid mthods category) |
m (Fixed link) |
||
| (2 intermediate revisions by 2 users not shown) | |||
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.
Line 273:
# [[Plurality criterion]]
# the winner is always chosen from the [[Immune set]]
# [[Chicken
# [[Strategy-Free criterion]]
# [[Generalized Strategy-Free criterion]]
Line 305:
== References ==
[https://github.com/dodecatheon/approval-sorted-margins] GitHub python code that compares Approval Sorted Margins to other Condorcet methods with explicit approval cutoff. See also '''
----
| |||