Distributed Voting: Difference between revisions
Extended description of ballot types
Aldo Tragni (talk | contribs) mNo edit summary |
Aldo Tragni (talk | contribs) (Extended description of ballot types) |
||
Line 5:
==Procedure==
[[File:DV Procedure.svg|alt=DV procedure|350px|thumb|DV procedure]]
[[File:
[[File:DV paper ballot.svg|310px|thumb|DV paper ballot]]
Voter has 100 points to distribute among the candidates.
Line 16 ⟶ 17:
The remaining candidates are the best (winners).
==
===Digital ballot===
In the paper ballot is used the ranges, that are easier to understand for a voter. In the procedure, a cumulative vote was used only to simplify the explanation.▼
By using self-resizing sliders it's possible to obtain simple ballot that use the cumulative vote, with 100 points to distribute. However, the ranges [0,10] can also be used for digital ballot, as described below.
===Paper ballot===
▲In the paper ballot is used the ranges, that are easier to understand for a voter.
Range [0,10] → Normalized in 100 points
Line 27 ⟶ 32:
10,5,5,0 → 50,25,25,0
10,6,3,1 → 50,30,15,5 (note: there isn't 0 in the lowest score)
===Real ballot===
The way to vote in Distribute Voting is, in theory, to assign 1 point to the least preferred candidate, and then assign points to the other candidates proportionally to the appreciation towards the less preferred candidate. Non-preferred (or unknown) candidates will remain with 0 points.
A vote like this: A[1] B[2] C[4] D[0] means that voter likes B 2 times A, and likes C 4 times A (or 2 times B). Vote like this: A[1] B[0] C[0] D[0] means that the voter likes only A. Both votes are then normalized to 100 points so that they have the same power.
This way of voting has no restrictions on the rating, therefore it offers the best representation of interests, but it's the most complex to understand and subject to tactical votes (in which certain candidates are awarded more points than necessary). To avoid such complexity and tactical votes, it's best to use range [0,10], by accepting a reduction in interest representation.
==Procedure specification==
Line 44 ⟶ 57:
v0 = old value of candidate X.
v1 = new value of candidate X.
P = 100 (total points used in a normalized vote)
<math>\begin{equation}
Line 127 ⟶ 140:
Meets the [[Honesty criterion]] (on hypotheses) because:
* at each [[Honesty criterion|Update Steps]] of the count, in which a candidate with points is removed, the tactical vote decreases the deviation from the honest one (the deviation is the sum of the absolute differences of the points for each candidate, between tactical and honest vote).
* the [[Honesty criterion|Honesty Step]] occurs when the candidate in the Winner Set is removed or when all the candidates in the Loser Set are removed. In the best case, the [[Honesty criterion|Honesty Step]] can occur in the first [[Honesty criterion|Update Steps]].
* the [[Honesty criterion|Honesty Step]] is always present because in the single winner, during the counting, all candidates are always removed from at least one of the two Sets.
Example - 1 winner
Honest vote: [50 30 15 5 0]
Tactical vote: [90 6 3 1 0]
| |||