Single distributed vote: Difference between revisions

Single distributed vote (view source)

60 bytes removed , 4 years ago

→‎Procedure: User:Dr. Edmonds, I'm assuming you didn't want the equation part preformatted and just wanted it under #3?

1,889

edits

Revision as of 23:09, 3 March 2020 (view source) Dr. Edmonds (talk \| contribs) (→‎Proportionality Threshold: Typo) ← Older edit		Revision as of 17:54, 5 March 2020 (view source) Psephomancy (talk \| contribs) (→‎Procedure: User:Dr. Edmonds, I'm assuming you didn't want the equation part preformatted and just wanted it under #3?) Newer edit →
Line 7: # Determine candidate with max summed (over voters) score. He is elected. # Update the entire score matrix. The v,c entry of the new matrix is #: <math>\begin{equation} \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. 4.# Go back to step 2 until desired number of winners have been elected. The first winner is the score winner. Then we allow ballot weight to be distributed between the first winner and all potential next winners according to the score given. The 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 winner and all potential next winners according to the score given. The 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…