electowiki

Single distributed vote: Difference between revisions

Page Discussion

Single distributed vote (view source)

Revision as of 17:25, 24 March 2024

308 bytes removed ,  1 month ago
m
→‎Variants
VisualWikitext
(minor update for clarity)
 
(5 intermediate revisions by 4 users not shown)
Line 1:
'''Single distributed vote''' (SDV) is an [[electoral system]] that extends the concept of [[Sequentialsequential proportional approval voting]] to [[Scorescore voting]] ballots. It is general [[Cardinal voting systems|Cardinalcardinal voting system]] which reduces to [[Sequentialsequential proportional approval voting]] with [[approval voting]] ballots. Proposed by [[Keith Edmonds]] in 2020,<ref> {{Cite web|url=https://forum.electionscience.org/t/unifying-thiele-and-unitary-philosophy/604|title=Unifying Thiele and Unitary philosophy|last=|first=|date=2020-02-16|website=The Center for Election Science forum|language=en-US|url-status=live|archive-url=|archive-date=|access-date=2020-04-16}}</ref> 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 [[Votevote unitarity]]. It a natural extension of the [[Webster]] or [[Jefferson Method]] to a [[Multi-Member System]].
 
==Procedure==
Line 7:
#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
#:<math>\frac{S_{v,c}^2 }{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}}▼
#:<math>\begin{equation}
</math>
▲ \frac{S_{v,c}^2 }{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
#:where <math>S_{v,c}</math> 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.
Line 15 ⟶ 14:
===Verbal Description===
 
The first winner is the [[Scorescore 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===
Line 21 ⟶ 20:
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.
 
<math>\frac{S_{v,c}^2 }{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}} = S_{v,c} \times \frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}} </math>▼
<math>\begin{equation}
▲\frac{S_{v,c}^2 }{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}} = S_{v,c} \times \frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
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 4 | 7 | 10 | 0 | 2 in the sequence in which they won. The ballot weight formula is
 
<math>\frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}}</math>▼
<math>\begin{equation}
▲\frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
When selecting the first winner there are no prior winners so the ballot weight formula reduces to
 
<math>\beginfrac{equationS_{v,c}}{ S_{v,c}} = 1</math>
\frac{S_{v,c}}{ S_{v,c}} = 1
\end{equation}</math>
 
Note that the ballot weight is always a value in [0,1] and will sum to 1 across all candidates for each voter at all times. The score matrix is the original one and the winner is the same as the [[Scorescore 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
 
<math>\frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}} = \frac{7}{ 7 + 2 \times 4} = \frac{7}{ 15}</math>▼
<math>\begin{equation}
▲\frac{S_{v,c}}{ S_{v,c} + 2 \times \Sigma_{winners j} S_{v,j}} = \frac{7}{ 7 + 2 \times 4} = \frac{7}{ 15}
\end{equation}</math>
 
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. Another, example can be seen pictorially in the accompanying image.
Line 49 ⟶ 40:
==Variants==
 
As with all [[Highesthighest averages method]] based systems there is a [[D'Hondt method | D'Hondt]] / [[Jefferson method]] as well as a [[Sainte-Laguë method | Sainte-Laguë/Webster method]] variant. The method described above is the [[Sainte-Laguë method | Sainte-Laguë/Webster method]]. The [[D'Hondt method | D'Hondt]] / [[Jefferson method]] variant can be achieved by removal of the 2 giving:
 
:<math>\frac{S_{v,c}^2 }{ S_{v,c} + \Sigma_{winners j} S_{v,j}}</math>▼
:<math>\begin{equation}
▲ \frac{S_{v,c}^2 }{ S_{v,c} + \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
==Generalization==
Line 59 ⟶ 48:
The most general form of the reweighting of the score matix <math>S_{v,c}</math> is
 
<math>\frac{S_{v,c} \times (A + B \times S_{v,c})}{ C + D \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}}</math>▼
<math>\begin{equation}
▲\frac{S_{v,c} \times (A + B \times S_{v,c})}{ C + D \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
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
 
<math>1 = \frac{A + B \times S_{v,c}}{C + D \times S_{v,c} }</math>▼
<math>\begin{equation}
▲ 1 = \frac{A + B \times S_{v,c}}{C + D \times S_{v,c} }
\end{equation}</math>
 
So we know A = C and B =D. This gives
 
<math>\frac{S_{v,c} \times (A + B \times S_{v,c})}{ A + B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}}</math>▼
<math>\begin{equation}
▲\frac{S_{v,c} \times (A + B \times S_{v,c})}{ A + B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
In this form [[Reweighted Range Voting]] is when A=1 and B=0 and [[Singlesingle distributed vote]] is when A=0 and B=1.
 
==Motivation for specific parameter choice==
 
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. However, such systems have later been characterized this way using the concept of Maximin Support. <ref>https://arxiv.org/abs/1609.05370</ref>
 
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.
Line 87 ⟶ 70:
ie if <math> S_{v,c} = 0 </math> then
 
<math>\frac{(A + B \times S_{v,c})}{ A + B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}} = 0</math>▼
<math>\begin{equation}
▲\frac{(A + B \times S_{v,c})}{ A + B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}} = 0
\end{equation}</math>
 
This implies A = 0.
Line 97 ⟶ 78:
With A = 0
 
<math>\frac{S_{v,c} \times (B \times S_{v,c})}{ B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}} </math>▼
<math>\begin{equation}
▲\frac{S_{v,c} \times (B \times S_{v,c})}{ B \times S_{v,c} + E \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
which is equal to
 
<math>\frac{S_{v,c} \times ( S_{v,c})}{ S_{v,c} + (E/B) \times \Sigma_{winners j} S_{v,j}} </math>▼
<math>\begin{equation}
▲\frac{S_{v,c} \times ( S_{v,c})}{ S_{v,c} + (E/B) \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
For simplicity, one can express the ratio of the constants as a single constant E/B = K giving the final form
 
<math>\frac{S_{v,c}^2 }{ S_{v,c} + K \times \Sigma_{winners j} S_{v,j}}</math>▼
<math>\begin{equation}
▲\frac{S_{v,c}^2 }{ S_{v,c} + K \times \Sigma_{winners j} S_{v,j}}
\end{equation}</math>
 
===Proportionality Threshold===
 
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 [[Proportionalproportional 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.
Line 134 ⟶ 109:
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]] fulfills multiplicative [[Scalescale invariance]] while [[Reweighted Range Voting]] does not. The [[Kotze-Pereira transformation]] can be used to add both multiplicative and additive [[Scalescale invariance]] to [[Reweighted Range Voting]] but it is an added complication to the system. The details can be seen on the page [[Kotze-Pereira_transformation#Scale_Invariance_example_for_RRV | here]].
 
==References==
Line 143 ⟶ 118:
[[Category:Multi-winner voting methods]]
[[Category:Cardinal PR methods]]
[[Category:Highest averages-reducing voting methodmethods]]
Retrieved from "https://electowiki.org/wiki/Special:MobileDiff/11317...18218"