Distributed Score Voting: Difference between revisions
Content added Content deleted
mNo edit summary |
Aldo Tragni (talk | contribs) (In the procedure, candidates outside the Smith set are eliminated after the conversion of the vote (point 3).) |
||
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 (it's also possible to write the vote even in a simpler form, with range from 0 to 5 points for each candidate). |
||
All candidates in the vote have 0 points by default. |
All candidates in the vote have 0 points by default. |
||
⚫ | |||
===Counting the votes=== |
===Counting the votes=== |
||
W = |
W = 100 for all votes, 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. |
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. |
||
Line 23: | Line 22: | ||
2) Find the smallest set X ([[Smith set]]) of nodes that don’t have incoming arrows, coming from outside the set. |
2) Find the smallest set X ([[Smith set]]) of nodes that don’t have incoming arrows, coming from outside the set. |
||
3) Convert the votes using the following formula: |
|||
⚫ | |||
3) Convert the votes into a range form, assigning 0 points to the candidates with the lowest score and normalizing the remaining candidates, using the following formula: |
|||
M = highest score among the candidates in the vote, before normalization. |
M = highest score among the candidates in the vote, before normalization. |
||
Line 37: | Line 34: | ||
v1=\frac{v0}{M} \cdot W |
v1=\frac{v0}{M} \cdot W |
||
\end{equation}</math> |
\end{equation}</math> |
||
⚫ | |||
4) Add up the points for each candidate of the range votes, and the candidate who has the highest sum, wins. |
4) Add up the points for each candidate of the range votes, and the candidate who has the highest sum, wins. |
||
Line 46: | Line 45: | ||
The value W of each original vote changes according to the following formula: |
The value W of each original vote changes according to the following formula: |
||
M = highest score among the candidates in the vote. |
M = highest score among the candidates in the vote (before removing the candidate). |
||
e = candidate's score eliminated. |
e = candidate's score eliminated. |
||
Line 97: | Line 96: | ||
Before the counting process, the votes will be normalized to 100-point votes, where the Xs are considered as equal weight values. |
Before the counting process, the votes will be normalized to 100-point votes, where the Xs are considered as equal weight values. |
||
Examples of how a vote can be written by the voter and subsequently, |
Examples of how a vote can be written by the voter and subsequently, before the counting, converted into 100 points: |
||
X,0,0,0,0 → 100,0,0,0,0 |
X,0,0,0,0 → 100,0,0,0,0 |