Distributed Voting: Difference between revisions
Added Distributed Equal-Vote
Aldo Tragni (talk | contribs) (Added extended procedure) |
Aldo Tragni (talk | contribs) (Added Distributed Equal-Vote) |
||
| (4 intermediate revisions by the same user not shown) | |||
Line 1:
[[File:DV Procedure.svg|alt=DV procedure|351px|thumb|DV procedure]]
Distributed Voting (DV) is a [[Single Member system|Single-Winner]] and [[Multi-Member System|Multi-Winner]], [[Cardinal voting systems]] proposed by [[User:Aldo Tragni|Aldo Tragni]].
==Procedure==
Line 11 ⟶ 9:
# The points of the eliminated candidate are proportionally redistributed in each vote (normalization).
By repeating processes 1 and 2,
==Extended procedure (single winner)==▼
▲==Extended procedure==
It's the procedure indicated above in which:
* the votes are reversed and made negative before counting ''(subtracting 9 from the original ratings)''.
* the candidate with the highest sum of points is eliminated (instead of those with lowest sum).▼
Original vote: A[9] B[7] C[5] D[3] E[1] F[0]
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 35:
===Digital ballot===
By using self-resizing sliders it's possible to obtain a simple ballot that use the cumulative vote, with 100 points to distribute. However, it's better to use range [0,9] also in digital ballot.
==Procedure specification==
Line 42:
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 129:
Each voter, based on his own interests, creates the following 2 sets of candidates:
* Winner Set = set containing a
* Loser Set = set containing the candidates who aren't part of the Winner Set.
Line 166:
* cancel the Equality in some steps of the count.
* increase the complexity of the counting.
* isn't appropriate to manage seats with different weights.
For these reasons, it's better to avoid using Surplus Handling in Distributed Voting System.
===Suitable for Web===
Line 178 ⟶ 177:
* Ex.2: in an image contest, there is a cash prize to be awarded to the 3 best images. The prize will be divided appropriately according to the % of victory and not in a pre-established way before the contest.
==Systems Variations==
===Distributed Equal-Vote (DEV)===
Voter score candidates with range [-5,+5]. Each ballot is normalized by distributing -100 points between negative ratings, and 100 points between positive ratings (distribution of points uses the normalization of [[Distributed Voting]]).
▲
By repeating the elimination process, the worst candidate is eliminated each time, and the remaining candidates are the winners.
''Equal-Vote because given a vote, there can always be an opposite one that cancels it.''
==Systems comparison==
Line 200 ⟶ 211:
===[[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 215 ⟶ 225:
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)
| |||