# Single distributed vote

**Single distributed vote** (SDV) is an electoral system that extends the concept of Sequential proportional approval voting to Score voting ballots. It is general Cardinal voting system which reduced to Sequential proportional approval voting with approval voting ballots. Proposed by Keith Edmonds in 2020,^{[1]} as a way to improve Reweighted Range Voting to be more in line with the desire to preserve vote weight. As such, it uses a similar but different vote conserving mechanism to Vote unitarity.

## Contents

## Procedure[edit | edit source]

- Acquire candidate score form voters and normalize them in [0,1] into a matrix. Voter, v, rates candidate, c, with score, .
- Determine candidate with max summed (over voters) score. That candidate is elected.
- Update the entire score matrix. The v,c entry of the new matrix is
- where is the
**original**score matrix not the one from the prior round.

- Go back to step 2 until desired number of winners have been elected.

### Verbal Description[edit | edit source]

The first winner is the Score voting winner. Then we allow ballot weight to be distributed between the first winner and all potential next winners according to the score given. The second winner is the candidate who has the highest sum score when it is down-weighted by the ballot weight they are supported with by each voter. Then we allow ballot weight to be distributed between the first two winners and all potential next winners according to the score given. The third winner is the candidate who has the highest sum score when it is down-weighted by the ballot weight they are supported with by each voter. And so on…

### Distribution Example[edit | edit source]

To illustrate how ballot weight is distributed it will now be shown how the scores are distributed across candidates. The formula for score matrix reweighting can be properly viewed as the original score matrix times a score dependant ballot weight.

In a 5 winner race, the following example will show the progression of redistribution at each step for a single voter. This voter scored the winners 0.4 | 0.7 | 1 | 0 | 0.2 in the sequence in which they won. The ballot weight formula is

When selecting the first winner there are no prior winners so the ballot weight formula reduces to

So the score matrix is the original one and the winner is the same as the Score voting winner. In the next round, the ballot weight is redistributed to the next potential winners in proportion to the score given to them. For the second winner, this amount would be

So at the end of this round the second winner has 7/15 of the ballot weight leaving 8 /15 with the first. Following the same formula the third winner has 10/32 of the ballot weight at the end of the third round. This is because 8/32 and 14/32 needed to be left with the first and second winners respectively. Note that later winners can receive more ballot weight if they are scored higher than prior winners. The fourth round has no effect since the voter gave a score of zero to that winner. In the final round, the winner receives 2/44 since the first three winners had to hold 8/44, 14/44 and 20/44 of the ballot weight.

When selecting the winner at each round the ballot weight for the next potential winners all depend on the score given to them. The winner is selected as the sum of scores multiplied by the ballot weight from each voter.

## Variants[edit | edit source]

As with all Highest averages method based systems there is a D'Hondt / Jefferson method as well as a Sainte-Laguë/Webster method variant. The method described above is the Sainte-Laguë/Webster method. The D'Hondt / Jefferson method variant can be achieved by removal of the 2 giving:

## Generalization[edit | edit source]

The most general form of the reweighting of the score matix is

A, B, C, D, and E are all constants to be determined. When no winners are elected for a voter we want no reweighting to be applied. This implies

So we know A = C and B =D. This gives

In this form Reweighted Range Voting is when A=1 and B=0 and Single distributed vote is when A=0 and B=1.

## Motivation for specific parameter choice[edit | edit source]

A desirable property of a sequential system is to conserved vote power across rounds. The most literal interpretation of this concept is Vote unitarity. An alternative idea is that instead of spending the amount of ballot it is distributed between previous winners and potential winners. The distribution would follow the rule that the total is preserved. Whichever potential winner has the most distributed vote power available to them wins. This concept is maintained in SPAV and highest average party list systems. Each voter has their vote split between all their approved winners and the next potential one. The formula for their ballot weight is 1/(1+W). It is not clear if this conservation of ballot weight was what lead Thiele to propose SPAV.

This rule is that for each voter the sum of all ballot fractions given to the prior winners is equal to 1 when combined with each potential winner. That is, the winners for each voter get some fraction of the ballot weight and the ballot weight is conserved.

To continue in the above derivation it would seem logical that when the score given is 0 we do not want the ballot to have any weight assigned to that candidate.

ie if then

This implies A = 0.

RRV gets around this because ballot weight is multiplied by the score so when the score is 0 there is no issue mathematically. RRV under the above conservation theory would assign ballot weight to those where the voter scored them 0. This is thought to be undesirable. It is a theory argument not really a practical one. RRV works it is just hard to motivate from theory. Even when ignoring the zero score candidates the ballot weight distributed to each candidate does not add to 1.

With A = 0

which is equal to

For simplicity, one can express the ratio of the constants as a single constant E/B = K giving the final form

### Proportionality Threshold[edit | edit source]

This last undetermined constant, K, was discussed above in the variant section. The value of 2 would give Webster reweighting. This is a common debate when designing a system intended to produce something like Proportional representation.

The key is to consider what the natural threshold should be in specific scenarios. Consider a 2 seat race with two factions Red and Blue. Assume Red is the larger party so it will win one of the seats. What fraction of votes does Red need to win the second seat? This all depends on the system but they all come down to two options for threshold.

Party list | Quota systems | Psi/Harmonic voting | Single distributed vote | Threshold |
---|---|---|---|---|

Sainte-Laguë/Webster | Hare | Δ=½ | K=2 | 3/4 |

d’Hondt/Jefferson | Droop | Δ=1 | K=1 | 2/3 |

The 3/4 threshold systems are related to the common Monroe's method interpretation for multi-member systems. This would mean K is just a tuning parameter and 2 is the correct value to get it to line up with Hare Quotas.

## Comparison to Reweighted Range Voting[edit | edit source]

This system is very similar to Reweighted Range Voting. The logic for the theoretical motivation is laid out above. While the concept of an underlying conserved ballot might be compelling theoretically it is worth considering the practical differences. While results are similar in most situation it is worth noting that Single distributed vote down-weights vote power the same or more than Reweighted Range Voting.

One clear benefit is that Single distributed vote is scale-invariant while Reweighted Range Voting is not. The Kotze-Pereira transformation can be used to add scale invariance to Reweighted Range Voting but it is an added complication to the system. The details can be seen on the page here.