Jump to content

Approval Sorted Margins: Difference between revisions

Modify criteria satisfaction, add Score Sorted Margins references
(→‎Sorted Margins heuristic: (Notes on Method) swap X with Y for clarity)
(Modify criteria satisfaction, add Score Sorted Margins references)
Line 273:
# [[Plurality criterion]]
# the winner is always chosen from the [[Immune set]]
# [[Chicken Dilemma criterion ]] ''(incompatible with [[Minimal Defense criterion]])''
# the winner is always chosen from the [[CDTT|CDTT set]]
# [[Minimal Defense criterion]]
# [[Strategy-Free criterion]]
# [[Generalized Strategy-Free criterion]]
Line 288 ⟶ 287:
# [[Consistency|Consistency criterion]]
# [[Tactical voting|invulnerability to compromising]]
# [[Tactical voting|invulnerability to burying]] ''(but has higher resistance than [[Beatpath]])''
# [[Favorite Betrayal criterion]]
# [[Later-no-harm criterion]]
 
''(TODO: check and find examples)''
 
== Score Sorted Margins variation ==
Instead of using an explicit approval cutoff, one can apply the Sorted Margins procedure to an initial seed ordering based on total score sum.
 
With sufficiently large range, ''e.g.'', zero to five or zero to 10, Score Sorted Margins usually yields the same winner as Approval Sorted Margins with a an appproval cutoff of Floor(MAXSCORE / 2).
 
== 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 '''ScoreSM.py''', a command-line python script to run Score Sorted Margins as a Droop quota-based score reweighted voting method.
 
----
40

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.