Distributed Score Voting: Difference between revisions
no edit summary
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) No edit summary |
||
Line 7:
==Procedure==
[[File:DVS procedure.jpg|thumb|DSV counting]]▼
===Voting===
▲[[File:DVS procedure.jpg|thumb|DSV counting]]
Each voter has 100 points to distribute among the candidates according to his preferences.
Line 17 ⟶ 16:
W = sum of all the points in the original vote (100 for all voters, at the beginning).
# Find the smallest set X of nodes that don’t have incoming arrows, coming from outside the set. Then remove all candidates not in X from the votes.▼
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.
# Convert the marks into a range form, assigning 0 points to the candidates with the lowest score and normalizing* the remaining candidates, using the following formula: M = candidate with the highest score, before normalization. v0 = current value of candidate C, to be normalized. v1 = value of candidate C, after normalization.▼
▲
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>
Line 25 ⟶ 36:
v1=\frac{v0}{M} \cdot W
\end{equation}</math>
#Add up the points for each candidate of the range votes, and the candidate who has the highest sum, wins. The choice of the single winner ends here.▼
# If you want to know the % of victory of the winning candidates then, in each original vote, you must remove all the candidates who haven’t won, and normalize* the vote with the formula used in point 3 (with W=100 fixed). The sum of points for each candidate will indicate the % of victory.▼
▲
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===
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 ⟶ 64:
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.
| |||