Approval Sorted Margins: Difference between revisions
Content added Content deleted
Psephomancy (talk | contribs) Tag: Undo |
(→Score Sorted Margins variation: Formal declaration) |
||
| Line 297: | Line 297: | ||
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). |
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). |
||
Formally summarized, as in Approval Sorted Margins, the result of Score Sorted Margins is a ranking in descending order, in which every sequential pair of candidates X<sub>i</sub> and X<sub>i+1</sub> is in order pairwise. That is, candidate X<sub>i</sub> is undefeated by candidate X<sub>i+1</sub> |
|||
* Initialize a ranking of all candidates in descending order of ''total score sum''. That is, for any sequential pair of candidates X and Y in the initial ranking, T[X] >= T[Y]. |
|||
* While any candidate Y is defeated by the candidate X following it in the list ''(that is, A[X,Y] > A[Y,X])'', |
|||
** Find the X and Y of this type that has the least difference in ''total score sum'' ''(that is, difference D = T[Y] - T[X] is minimal)'', and modify the list by swapping the order of X and Y. |
|||
== References == |
== References == |
||