SODA voting (Simple Optionally-Delegated Approval): Difference between revisions

:a) '''Before the election, all candidates must strictly rank theall other official candidates in order of preference. Equal rankings are not allowed.''' ''These pre-announced preferences allow voters to make informed decisions in step 2; and prevent corrupt vote-selling in step 3, where candidates may only approve others in a way that is consistent with their preferences.''

::i. If the candidate using their delegated votes has more than 5% approval, '''they may choose which candidates approve on their delegated ballots, <u>consistent with preferences</u>,''' with equally preferred ties ''(optionally)'' broken by current approval totals. ''This tie-breaking by approval totals resolves the "chicken dilemma", as explained below.''

<small>'''<u>Consistent with preferences</u>, with equally preferred ties broken by current approval totals''': For example, candidate A may not approve B and not C unless ''either'' A predeclared a preference for B over C, ''or'' A predeclared B and C equal and B currently has more approvals than C.</small>

<small>'''<u>Automatic approvals</u>''': When approvals are assigned automatically for candidate X, they are set to approve as many of their pre-declared preferences as possible without approving both of the two candidates with the highest current approval totals that they prefer differently. (For example, say that X's preferences were for (A and >B), then >C, then (>D and >E), and the approval totals are 4010, 30, 10, 20, and 15 alphabetically. A has the highest total; B has the next-highest, but does not count, because they are preferred equally to A; and D hashave the next-highest totals. So X's delegated ballots will be assigned to approve as many candidates as possible without approving both AB and D; that is, they will approve A, B, and C.)</small>