Simple Optionally-Delegated Approval (SODA voting) is a single-winner voting system based on approval voting. As in approval voting, voters get a ballot which lets them vote for as many or as few candidates as they like. Unlike in approval, voters who don't want to decide yes or no for every candidate can choose to delegate their ballot, trusting their favorite candidate to "fill in the ballot" by adding further approvals. The voters' ballots are counted and preliminary totals are announced. Then, once everyone knows how much support and how many delegated ballots each candidate has, those who do not expect to win can add approvals to the delegated ballots they control, in order to help others who would be good compromise options.
Approvals added by a candidate to their delegated ballots are worth the same as direct approvals from voters. Both types of approval are added together and the winner is the candidate with the most total approvals.
Procedure[edit | edit source]
Sample Ballot[edit | edit source]
Vote for as many candidates as you approve, or vote for one candidate to delegate your vote:
If you only vote for one candidate, your vote is delegated to that candidate, unless you check the box below. A delegated vote means that, if your favorite candidate shows preferences above, he or she may use your vote to approve of one or more of the most-preferred of them. For instance, if he or she can not win, he or she might approve of some other "compromise" candidate(s) who can.
Full, step-by-step rules[edit | edit source]
Steps marked "(optional)" are suggested, but only the four substeps in bold (1a, 2b, 3b, and 3b.i) are necessary for the system to function. Explanations in italics give the purpose behind each step. Underlined terms are defined on the right.
|1. Candidates publicly declare their rankings of the other candidates|
Enforcing mutual approval agreements: If A ranked B higher than B ranked A, then A may respond by lowering B's ranking. B may respond by raising A, and A may then respond by restoring B to the original ranking. If B raised A above C, then C may lower A, but A may not respond. Three rounds of response are all that are allowed.
Most complete: Completeness of ranking is scored by how many possible pairs of other candidates contain two candidates at different levels.
Delegated votes:The delegated votes for candidate X is the number of ballots that approve only X and do not mark "Do not delegate". X will get a chance to effectively add additional approvals to these votes; or, if X has less than 5% approval, then additional approvals will be added automatically, in order to attain a better result by X's predeclared preferences.
Total approvals:The total approvals for candidate X is initially the number of ballots that approve X, including X's delegated ballots. This number increases through the process as other candidates use their delegated ballots to approve X.
Use their delegated ballots: The process by which a candidate effectively adds approvals to the votes delegated to him or her. When, for example, candidate A uses their delegated ballots to approve of B and C, then B and C's approval totals are each increased by A's delegated vote total. When it is a candidate's turn, they may choose to approve of nobody else, for instance if they believe they will win; but this counts as using their delegated votes, and they will not be given another chance to change that decision. When all candidates have used their votes, the election is over.
'Consistent with preferences: For example, candidate A may not approve B and not C unless A predeclared a preference for B over C.
Automatic approvals: 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>B>C>D>E, and the approval totals are 10, 30, 10, 20, and 15 alphabetically. B and D have the highest totals. So X's delegated ballots will be assigned to approve as many candidates as possible without approving both B and D; that is, they will approve A, B, and C.)
4. When step 3b ends, highest total wins
Notes on rules[edit | edit source]
(technical issues; moved to talk page)
Example[edit | edit source]
Imagine that Tennessee is having an election on the location of its capital. The population of Tennessee is concentrated around its four major cities, which are spread throughout the state. For this example, suppose that the entire electorate lives in these four cities, and that everyone wants to live as near the capital as possible.
The candidates for the capital are:
- Memphis, the state's largest city, with 42% of the voters, but located far from the other cities
- Nashville, with 26% of the voters, near the center of Tennessee
- Knoxville, with 17% of the voters
- Chattanooga, with 15% of the voters
The preferences of the voters would be divided like this:
|42% of voters
(close to Memphis)
|26% of voters
(close to Nashville)
|15% of voters
(close to Chattanooga)
|17% of voters|
(close to Knoxville)
In this simplified example, all the residents of each city agree on the rankings of all the other cities, so there would be no reason for anybody to do anything but bullet vote. Memphis has the first option to choose approvals for its delegated votes, and, as the leader, decides to approve noone but itself. Nashville goes second; it is the pairwise champion (Condorcet winner), so it also declines to approve any others. Chattanooga and Knoxville would approve each other and Nashville, to prevent Memphis from winning. Nashville would then be the winner, with 58% approval after delegation.
Chattanooga could, before the election, not include Nashville in its preference list, hoping to force Nashville to approve it. But in that case Memphis would approve Nashville to prevent Nashville from being forced to hand the election to Chattanooga, and so Nashville would win with an even larger majority. Therefore, Chattanooga will not attempt this.
Advantages[edit | edit source]
SODA has advantages for many groups. In fact, most of the advantages would fit in more than one of the categories below, so the division is somewhat arbitrary. Also, on the talk page (click "discussion" above) there are also two "hard sell" SODA pitches for two different audiences, which restate these advantages in more-opinionated terms.
For voters[edit | edit source]
- SODA is extremely easy for the voters; in fact, no voting system is simpler to vote. Plurality, by restricting you to only one vote, also makes it possible to mistakenly "overvote", spoiling your ballot. There is no such way to accidentally invalidate your ballot under SODA. Also, both Plurality and Approval require a conscientious voter to consider strategy and polling status; SODA allows a simple bullet vote to still be strategically as strong as possible, regardless of the candidate standings.
- Under SODA, there is no need for dishonesty from individual voters. A voter can safely vote for any candidate that they honestly agree with, without fear of that vote being wasted; or safely vote an honest approval-style ballot, if they do not agree with any candidate's preference order. This is drastically different from plurality, where voters must dishonestly spurn "spoiler" candidates as a matter of course.
- SODA does not require you to trust any politician. Any vote delegation is both safe (you can see where your delegated vote may go) and entirely optional. There's no "smoke-filled room"; any voter who dislikes how their delegated vote might be used, can simply choose not to delegate.
For society (results)[edit | edit source]
- SODA is far more likely to arrive at a majority result than Plurality (or even IRV). Winners will thus have a clearer mandate. In fact, SODA may be more likely to elect the pairwise champion (aka Condorcet winner, the candidate who could beat all others one-on-one) than any other system (except SODA-DAC). See the technical discussion below for the assumptions that would make this true.
- SODA would increase voter turnout, leading to better, more-democratic results.
- However, unexpected, relatively unknown or unqualified winners will be as rare or rarer under SODA than under Approval or a Condorcet system. In a polarized society, Condorcet or Approval can have such a strong tendency to elect centrists that even unqualified, largely-unknown centrists have an advantage over better-known candidates; SODA will not have such a tendency unless the stronger candidates consciously choose this as a compromise.
For society (process)[edit | edit source]
- SODA balances voice for minority leaders with power for majority winners or coalitions. In fact, you could say that SODA combines the best of both worlds - the negotiated, everyone-gets-a-voice majority coalitions of parliamentary government, with the decisive, buck-stops-here clear winner of a US-style system.
- SODA would reduce negative campaigns. A negative personal attack against opponent A would often just shift votes to another opponent B who would end up sharing them back with A in the delegation round. (In fact, some parties might decide to run two candidates per race, to explicitly take advantage of this phenomenon). Meanwhile, the candidate carrying out the attacks could also suffer if voters saw them as a slimy mudslinger.
- Like many other voting reforms, SODA would reduce the influence of money in political campaigns. Plurality, with its overriding need to be a frontrunner, exaggerates the importance of money. Any candidate who's not one of the two best-funded, is almost certainly at best a spoiler, and is thus aggressively ignored by voters and media. SODA in particular, by encouraging meaningful campaigns and get-out-the-vote operations by minor candidates, while still ensuring that the extra turnout those generated would have an effective impact in deciding between the major candidates, would help substitute grassroots people-power for dollar-power in campaigns.
- SODA is easier to count and more fraud-resistant than most systems, including IRV. It also can be run on most voting machines, including even old and outdated systems.
For activists[edit | edit source]
- SODA is arguably better than Plurality voting in every way (Pareto dominant). Although other systems may offer even-greater advantages over plurality, they also come with certain disadvantages. Those disadvantages may be minor; but they give an opportunity for lobbyists, corrupt politicians, and other reform opponents to attack the reform, and put reform advocates on the defensive. A SODA advocate can devote all their attention to its advantages.
- SODA would lead to less infighting. Because it solves the spoiler problem, there's no need for pointless debate between radicals who want to pressure their side and moderates who want to support it. Substantive debate would continue, but with less need for unhelpful acrimony.
- Because it allows more voices in the debate, SODA would support the passage of other reforms such as campaign finance reform. The current two-party system sees these issues, which should be bipartisan, through a partisan lens, crippling their progress. By breaking the two-party monopoly, SODA would open the potential for more cross-partisan alliances and independent support on these matters. (See the first process advantage above. One way that SODA would bring new ideas into the public debate is by giving a better voice to the leaders of smaller parties.)
For politicians[edit | edit source]
- SODA should be generally acceptable to honest officeholders, who are winners in a Plurality two-party system. Most of their familiar ways of thinking about the campaign would still work - except that it would reduce negative campaigning. Plurality-style voting still works just fine, and if most votes are for major parties, this system will cleanly allow a major party to win, in many cases without going to the delegation round (especially if the major-party candidates do not pre-announce delegation preferences, thus preventing an extorting minor party from demanding their delegated votes).
- SODA would make a politician's job more fun. Less time spent on fundraising (see process advantage #3), fewer attack ads from opponents (see process advantage #2); what's not to like? Sure, nobody would be a politician today without a high tolerance for these problems, but even for politicians, negative ads and the fundraising treadmill have gotten out of hand.
- SODA reduces the threat from unserious candidates. Under plurality, even an unqualified candidate can be a spoiler. Under Condorcet or Approval, they can prosper simply because of second-choice support from two polarized camps. In fact, in the latter case, candidates can do better the less voters know about them! If there's anything that annoys a serious politician, it's losing to an unqualified cipher. SODA has no such problem, unless one of the candidates with more first-choice votes puts their reputation on the line by explicitly choosing the centrist (in order to avoid something worse), not just once but two times. That's not going to happen for an unknown.
Criticism and responses[edit | edit source]
"Too complex"? No; simplest for voters.[edit | edit source]
While the rules for counting SODA are indeed a bit complex, no other system is simpler for the voters, allowing them to simply vote their favorite and go home confident that their vote has full strategic power.
"Delegation is undemocratic"? No; it's a free choice by voters.[edit | edit source]
Simple response: if you don't want to delegate, don't delegate. You can still vote for whomever you want.
Disliking delegation is no more a reason to oppose SODA, than disliking chocolate is a reason to oppose candy stores. SODA allows delegation, it doesn't force it.
Also, since candidate's additional approvals must accord with their pre-declared preferences, there is no opportunity for strategy as long as those preferences were honestly-declared. And the preferences do not represent back-room wheeling and dealing; they are public positions. The various risks of dishonestly declaring one's preference clearly outweigh the unlikely chance that doing so would give some strategic benefit.
Simple response to a politician who makes this argument: "You just want the only smoke-filled room to be the one inside your skull." That is, minority factions should have a seat at the table, as long as everything is done transparently. The two-party system stifles some of the valid concerns of the members of the party coalitions. In SODA, all vote totals, preference orders, and final approvals added to delegated ballots are known; in the end, that's not a smoke-filled room, it's a transparent seat at the table, with a just degree of power which is derived from the people.
"There are other systems which are better in some ways"? Yes, but unlike them, SODA is better than plurality in ALL ways.[edit | edit source]
This is true. Condorcet, Range Voting, and Median systems like Majority Approval Voting (or others: Majority Judgment, MCA, or Bucklin) each have some claim to be the "best voting system". But SODA is the best system which has no downsides versus plurality. All those other systems require more-complicated ballots. All of them require more-complicated, or even dishonest, strategic decisions from the voter, to get the most effective vote.
So in the end, while any of those other systems would be, in my opinion, a clear net benefit versus plurality, with SODA you don't need any qualifications like "net benefit" or "in my opinion". It is simply better, in every way.
"Sounds too much like a parliamentary system, which has caused problems in [Italy / Israel / wherever]"? No, SODA still leaves "buck stops here" responsibility.[edit | edit source]
SODA does involve some parliamentary-style negotiation for a short period after each election. But then it's done, and the winner is in power until the next election. Unstable parliamentary countries, or ones where minority parties have inordinate power, are that way because minority parties can leave the governing coalition at will, triggering new elections. SODA does not have that problem; in many ways, it's really the best of both worlds between a 3-branch system and a parliamentary system.
"Why go to the trouble of pre-announced rankings and a second round? Why not just have candidates pre-announce the approvals they will add to their delegated votes?" Because the best compromise is only clear after the votes are tallied.[edit | edit source]
This sounds appealing, but would not work if two similar candidates were in a close race to see which had more first-choice votes, while an opponent stood ready to take advantage if they split the vote (that is, in the Chicken Dilemma, also discussed on the talk page). The system as it stands allows the similar candidates to see, after the votes are counted, which of them deserves to win: the one with the higher approval total. That one will go first and not delegate their votes, and then other one (of necessity) will.
In general, this system, because it provides perfect information on voting totals at the time when delegation is happening, will make strategy obvious. This has the paradoxical result that, as long as most voters agree with their favored candidate's chosen ranking order, this system will in practice be more Condorcet compliant than a Condorcet method (because strategy could confound a true Condorcet method more often than SODA).
Criteria Compliance[edit | edit source]
SODA itself does not satisfy monotonicity due to a complicated and implausible scenario involving 5 or more candidates. However, a slightly-modified version in which, before the delegated assignments, candidates can self-assign a penalty to be assessed at the end of the delegated assignment round, does. This modified version, MODA, is effectively identical to SODA for any plausible real-world election.
MODA satisfies monotonicity, the favorite betrayal criterion, the majority criterion, and the mutual majority criterion. Depending on assumptions and definitions, it can pass the Condorcet loser criterion.
It does not satisfy the independence of irrelevant alternatives criterion in general, but it does if the "irrelevant alternative" is assumed to delegate votes in the same way as any candidate whose delegable votes they supplant. Similarly, it can only pass the participation and consistency criteria if it is assumed that candidate delegations do not change. These assumptions are not realistic, but they do show that the method is in some sense "close to" passing these criteria.
In any case where honest delegation could show a majority Condorcet winner, such delegation forms a strong Nash equilibrium. This shows that in general, strategic refusal to delegate is likely to fail.
Condorcet criterion (includes highly technical discussion)[edit | edit source]
SODA fails the Condorcet criterion, although the majority Condorcet winner over the ranking-augmented ballots is the unique strong, subgame-perfect equilibrium winner. That is to say that, the method would in fact pass the majority Condorcet winner criterion, assuming the following:
- Candidates are honest in their pre-election rankings. This could be because they are innately unwilling to be dishonest, because they are unable to calculate a useful dishonest strategy, or, most likely, because they fear dishonesty would lose them delegated votes. That is, voters who disagreed with the dishonest rankings might vote approval-style instead of delegating, and voters who perceived the rankings as dishonest might thereby value the candidate less.
- Candidates are rationally strategic in sharing their delegated vote. Since this process is sequential, game theory states that there is always a subgame-perfect Nash equilibrium, which is always unique except in some cases of tied preferences.
- Voters are rationally strategic or otherwise able to use the system to express all relevant preferences. That is to say, all voters fall into one of two groups: those who agree with their favored candidate's declared preference order and thus can fully express that by delegating their vote; or those who disagree with their favored candidate's preferences, but are aware of who the Condorcet winner is, and are able to use the approval-style ballot to express their preference between the CW and all second-place candidates. "Second place" means the Smith set if the Condorcet winner were removed from the election; thus, for this assumption to hold, each voter must prefer the CW to all members of this second-place Smith set or vice versa. That's obviously always true if there is a single second-place CW.
- Delegated votes are honest. That is, voters do not delegate their vote to a candidate whom they disagree with. Though such a strategy might work in limited circumstances (when a candidate with exactly the right preferences was available to use to create a Condorcet cycle which didn't include themself), it would be both more trusting and risky than the average strategic betrayal, and also more cold-bloodedly dishonest. To exaggerate the case: how often are psychopaths good at trusting people?
The assumptions above would probably not strictly hold true in a real-life election, but they usually would be close enough to ensure that the system does elect the CW.
SODA does even better than this if there are only 3 candidates, or if the Condorcet winner goes first in sharing delegated votes, or if there are 4 candidates and the CW goes second. In any of those circumstances, under the first three assumptions above (but without needing the last one), it passes the Condorcet criterion, not just the majority Condorcet criterion. The important difference between the Condorcet criterion (anyone who beats all others pairwise must win) and the majority Condorcet criterion (anyone who beats all others pairwise by a strict majority must win) is that the former is clone-proof while the latter is not. Thus, with few enough strong candidates, SODA also passes the independence of clones criterion.
I believe, though have not proved, that the prior paragraph would always hold regardless of the number of candidates, if the candidates were to add approvals to delegated votes in the DAC order instead of simply in order of approval score. This is not part of the definition of the method for simplicity's sake.
Note that, although the circumstances where SODA passes the Condorcet criterion are hemmed in by assumptions, when it does pass, it does so in a perfectly strategy-proof sense. That is not true of any actual Condorcet system (that is, any system which universally passes the Condorcet criterion). Therefore, for rationally-strategic voters who believe and are correct that the above assumptions are likely to practically hold, SODA may in practice pass the Condorcet criterion more often than a Condorcet system.
SODA-PR (obsolete; see PAL representation)[edit | edit source]
(Section obsolete; for a proportional representation system based on SODA-like ideas, with several unique advantages, see PAL representation.)
Compatibility with the US electoral college[edit | edit source]
A state could adopt SODA for assigning its electors in the electoral college. If the state did not wish to dilute its voting power, it could adopt SODA, conditional on a certain number of total electoral votes being assigned in a non-winner-take-all fashion.
The way to do this would be to use a divisor-based Proportional Representation process to assign electors between delegated votes for each of the candidates and "undelegated approval electors".
Each candidate's electors would be sworn to vote as directed by that candidate (not necessarily for that candidate), if consistent with that candidate's pre-approvals.
Each "undelegated approval elector" would know the statewide non-delegated approval total, and the total of number of affiliated electors throughout the EC, for each candidate. Other "approval electors" would count as fractionally affiliated based on their known approval totals. These electors would be sworn to vote for whichever of the two candidates with the most nationwide electors had the highest statewide undelegated approval total. They would be chosen by the candidate for whom they were sworn to vote.