Distributed Multi-Voting: Difference between revisions
m
no edit summary
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) mNo edit summary |
||
| (One intermediate revision by the same user not shown) | |||
Line 26:
If the candidates of the subset, in a certain vote, all have the same score different from 0 then, before normalization, don’t set the lowest score to 0.
==Tactical vote resistance==
The original vote of the voter through point 1 of the procedure is converted, and the vote obtained is in part of the type:
Line 182 ⟶ 35:
* cumulative, because the points distributed in the converted votes are however limited and fixed (700 in the case [1], 1000 in the cases [2] and [4], 1100 in the cases [3], [5], [6] based the number of candidates evaluated).
Meets [[Honesty criterion]] under the same assumptions as the [[Distributed Voting#Tactical vote resistance|Distributed Voting]].
Line 205 ⟶ 54:
In cases [1] and [2] it’s noted that the addition of 1 point on B, left the score of A practically unchanged in the converted vote, but in case [2] it obtained 303 points for B (same speech observing the case [3] or even [5] ); this means that the voter has an interest in expressing his preference towards B. At the same time, the voter doesn’t even have the interest of giving his limited points to candidates he doesn’t really support (reduced [[Vote splitting]]) .
==Systems variants (Multi-Voting method)==
In general, starting from a vote, all the votes are obtained for each subset of the candidates (some normalization is used), and then they are added together obtaining the converted vote. Subsequently, the count on the converted votes is applied.
===Score Multi-Voting (SMV)===
The following formula is used to normalize the votes:
[MIN, MAX] = ''[0,9]'' = range of the voting system.
[min, max] = ''[3,6]'' = lower and higher value among the candidates of the subset, in a vote.
Cnew = new value of the candidate, in a vote.
C = old value of the candidate, in a vote.
<math>\begin{equation}
C_{new} \ =\ MIN\ +\ ( C\ -\ min) \cdot \frac{MAX\ -\ MIN}{max\ -\ min}
\end{equation}</math>
If max = min, then Cnew = MAX
Example of normalized voting for a subset of candidates:
Original vote: A[9] B[6] C[5] D[3] F[0] G[1] H[1]
Subset {A,C,F}: A[9] C[5] F[0]
Subset {A,B,C}: A[9] B[2.25] C[0]
Subset {C,D,F}: C[9] D[5.4] F[0]
Subset {B,C,D}: B[9] C[6] D[0]
Subset {B,C,D,F}: B[9] C[7.5] D[4.5] F[0]
Subset {G,H}: G[9] H[9]
Subset...
By adding the converted votes, the candidate with the highest sum wins.
===STAR Multi-Voting (STAR-MV)===
The converted votes are calculated, as in the Score Multi-Voting, on which the STAR count is then applied.
[[Category:Cardinal voting methods]]
[[Category:Single-winner voting methods]]
| |||