Distributed Multi-Voting: Difference between revisions
m
no edit summary
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) mNo edit summary |
||
Line 6:
[[File:DMV procedure.jpg|thumb|DMV procedure]]
Each voter has 100 points to distribute among the candidates according to his preferences. All candidates in the vote have 0 points by default.
# For each single vote, get the normalized votes on all subsets
# After obtaining all the converted original votes, the candidate with the lowest sum, of the converted votes, loses.
# Eliminate the loser from all the original votes, and setting the candidate with the lowest score in each vote to 0. Repeat the whole process from the beginning, leaving as many winner as you like.
Line 15:
* set the candidate (s) with the lowest score between A,B,C to 0.
* apply the following formula on the other candidates:
S = sum of
v0 = value of candidate X, before normalization
v1 = value of candidate X, after normalization.
<math>\begin{equation}
In normalization for the % of victory, use the same formula without setting the candidate with the lowest score to 0.
| |||