Distributed Score Voting: Difference between revisions
Content added Content deleted
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) No edit summary |
||
Line 7: | Line 7: | ||
==Procedure== |
==Procedure== |
||
⚫ | |||
===Voting=== |
===Voting=== |
||
⚫ | |||
Each voter has 100 points to distribute among the candidates according to his preferences. |
Each voter has 100 points to distribute among the candidates according to his preferences. |
||
Line 17: | Line 16: | ||
W = sum of all the points in the original vote (100 for all voters, at the beginning). |
W = sum of all the points in the original vote (100 for all voters, at the beginning). |
||
1) All head-to-head matches are conducted between candidates. In head-to-head, the candidate who has more points in a vote than his opponent receives W points from the vote. The candidate who gets the most points wins the head-to-head. |
|||
⚫ | |||
Graphically, each candidate is a node; the head-to-head is represented by an arrow, leaving the winning candidate, entering the losing candidate. The tie is represented as a double arrow entering, that is both candidates are considered losers. |
|||
⚫ | |||
⚫ | |||
Then remove all candidates not in X from the votes. |
|||
⚫ | |||
M = candidate with the highest score, before normalization. |
|||
v0 = current value of candidate C, to be normalized. |
|||
v1 = value of candidate C, after normalization. |
|||
<math> |
<math> |
||
Line 25: | Line 36: | ||
v1=\frac{v0}{M} \cdot W |
v1=\frac{v0}{M} \cdot W |
||
\end{equation}</math> |
\end{equation}</math> |
||
⚫ | |||
# If you want to have more winners, then remove the single-winner from all original votes, repeating the whole procedure from point 1. The value W of each original vote is reduced by the points assigned to the removed candidate. By repeating this process several times, I can get as many winners as I like, which will be those removed in point 5. |
|||
⚫ | |||
⚫ | |||
The choice of the single winner ends here. |
|||
5) If you want to have more winners, then remove the single-winner from all original votes, repeating the whole procedure from point 1. |
|||
The value W of each original vote is reduced by the points assigned to the removed candidate. |
|||
By repeating this process several times, you can get as many winners as you like, which will be those removed in point 5. |
|||
⚫ | |||
<br /> |
|||
===Head-to-head=== |
===Head-to-head=== |
||
In a head-to-head between candidates A and B, a vote like A[10], B[30], C[60], D[0] could be treated in 2 different forms: |
In a head-to-head between candidates A and B, a vote like A[10], B[30], C[60], D[0] could be treated in 2 different forms: |
||
Line 43: | Line 64: | ||
This form avoids all the problems mentioned above. |
This form avoids all the problems mentioned above. |
||
===Simplified voting writing=== |
|||
To make the writing of the vote more comprehensible and simple, the voter can be left with almost complete freedom in the use of numerical values or only X. |
|||
Before the counting process, the grades will be normalized to 100-point grades, where the Xs are considered as equal weight values. |
|||
Examples of how a vote can be written by the voter and subsequently, in the counting, converted into 100 points: |
|||
X,0,0,0,0 → 100,0,0,0,0 |
|||
X,X,X,X,0 → 25,25,25,25,0 |
|||
4,3,2,1,0 → 40,30,20,10,0 |
|||
40,6,3,1,0 → 80,12,6,2,0 |
|||
101,0,0,0,0 → 100,0,0,0,0 |
|||
The complexity in writing the vote adapts to the voter, and it’s also noted that, if 101 or 99 points are mistakenly distributed, the vote will still be valid. |