Distributed Voting: Difference between revisions
m
Extended procedure explanation made clearer
Aldo Tragni (talk | contribs) mNo edit summary |
Aldo Tragni (talk | contribs) m (Extended procedure explanation made clearer) |
||
Line 19:
Reversed vote, made negative: A[0] B[-2] C[-4] D[-6] E[-8] F[-9]
''Reversing and making negative means that the voter's 100 points are used to disadvantage the worst from winning (points will be always negative in the counting). This procedure reduces the failure of monotony, for the single-winner case, and increases resistance to min-maxing strategies.''
==Ballot==
Line 43:
P = 100 (can also be set to 1).
S = points sum of the candidates remaining in the vote, after an elimination.
V = old points value of candidate X.
newV = new points value of candidate X.
<math>\begin{equation}
Line 199:
===[[IRNR]]===
[[IRNR]] (L1 norm) is applied
Range [0,10] with IRNR
61: A[10] B[6] C[0]
39: A[0] B[6] C[10]
Eliminated in order C,A.
B wins.
Range [-5,+5] with IRNR
Line 214 ⟶ 213:
A wins.
In IRNR only by
IRNR is a [[Single Member system|Single-Winner system]] which also, unlike Distributed Voting, doesn't reverse and make negative the vote before the count.
==Related Systems ==
* [[Instant Runoff Normalized Ratings]] (ratings also negative, and it doesn't reverse and make negative the vote)▼
▲* [[Instant Runoff Normalized Ratings]] (ratings also negative)
* [[Baldwin's method]] (Borda, and variant with different normalization)
|