Distributed Voting: Difference between revisions

← Older edit

Distributed Voting (view source)

Revision as of 17:53, 30 March 2021

246 bytes added , 3 years ago

Added Distributed Equal-Vote

VisualWikitext

Aldo Tragni

206

edits

Revision as of 09:51, 20 September 2020 (view source) Aldo Tragni (talk \| contribs) mNo edit summary ← Older edit		Latest revision as of 17:53, 30 March 2021 (view source) Aldo Tragni (talk \| contribs) (Added Distributed Equal-Vote)
(2 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]]. ~~This system, in the [[Single Member system\|Single-Winner]] context, avoids the ambiguity of the [[IRNR]] (L1 norm). More information in the dedicated [[Distributed Voting#IRNR\|section]].~~ ==Procedure== Line 11 ⟶ 9: # The points of the eliminated candidate are proportionally redistributed in each vote (normalization). By repeating processes 1 and 2, the worst candidate is eliminated each time, and the remaining candidates are the winners. ~~The remaining candidates are the best (winners).~~ ==Extended procedure (single winner)== 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 the 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.'' ▲ Original vote: A[9] B[7] C[5] D[3] E[1] F[0] ▲ Reversed vote: A[0] B[2] C[4] D[6] E[8] F[9] ==Ballot== Line 45 ⟶ 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 169 ⟶ 166: * cancel the Equality in some steps of the count. * increase the complexity of the counting. * if a voter votes A[99] B[1] C[0], in case A wins by getting double the threshold, the voter would be very satisfied with A's victory, then move half the points from A to B would mean giving the voter extra unjustified satisfaction (he's already 99% satisfied with the victory of A). * isn't appropriate to manage seats with different weights. Line 181 ⟶ 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]]). ▲* theThe candidate with the ~~highest~~lowest sum of points is eliminated, ~~(instead~~and ofballots ~~those with the lowest sum)~~normalized. 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 203 ⟶ 211: ===[[IRNR]]=== [[IRNR]] (L1 norm) is applied ~~on rating ballots,~~ also on ranges with negative values such as [-5,+5]. ~~Distributed~~but ~~Voting,~~this inmakes ~~the~~it ~~[[Single Member system\|Single-Winner]] context, is a subcategory of IRNR, which binds the minimum value of the rating ballots~~subject to ~~0 (doesn't accept ratings with negative values)~~ambiguity. ~~This constraint is important because it avoids the ambiguity of the IRNR:~~ Range [0,10] with IRNR ~~and Distributed Voting~~ 61: A[10] B[6] C[0] 39: A[0] B[6] C[10] Eliminated in order C,A. B wins. ~~IRNR and Distributed Voting are equivalent in this case.~~ Range [-5,+5] with IRNR Line 218 ⟶ 225: A wins. In IRNR only by ~~changing~~moving the range, in negative value (leaving the interests of the voters and the size of the range unchanged), the winner changes. Distributed Voting instead avoid this ambiguity by imposing 0 as the minimum value in the ~~rating~~range. 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. ~~Using the extended procedure instead, Distributed Voting is different from IRNR.~~ ==Related Systems == * [[Instant Runoff Normalized Ratings]] (ratings also negative, and it doesn't reverse and make negative the vote)▼ * [[Distributed Multi-Voting]] (particular vote conversion) ▲* [[Instant Runoff Normalized Ratings]] (ratings also negative) * [[Baldwin's method]] (Borda, and variant with different normalization)