Distributed Voting: Difference between revisions

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]].

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:

Line 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.

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 before counting.

* 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. This procedure reduces the failure of monotony, for the single-winner case.''

⚫

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:

Line 42:

P = 100 (can also be set to 1).

S = points sum of the candidates remaining in the vote.

S = points sum of the candidates remaining in the vote, after an elimination.

V = old value of candidate X.

newV = new value of candidate X.

Line 169:

Line 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 203:

Line 199:

===[[IRNR]]===

[[IRNR]] (L1 norm) is applied on rating ballots, also on ranges with negative values such as [-5,+5]. Distributed Voting, in the [[Single Member system|Single-Winner]] context, is a subcategory of IRNR, which binds the minimum value of the rating ballots to 0 (doesn't accept ratings with negative values). This constraint is important because it avoids the ambiguity of the IRNR:

[[IRNR]] (L1 norm) is applied on rating ballots, also on ranges with negative values such as [-5,+5]. Distributed Voting (not extended), in the [[Single Member system|Single-Winner]] context, is a subcategory of IRNR, which binds the minimum value of the rating ballots to 0 (doesn't accept ratings with negative values). This constraint is important because it avoids the ambiguity of the IRNR:

Range [0,10] with IRNR and Distributed Voting

Line 218:

Line 214:

A wins.

In IRNR only by changing the range, 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.

In IRNR only by changing the extremes of the range (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.

Using the extended procedure instead, Distributed Voting is different from IRNR.

==Related Systems ==