Distributed Voting: Difference between revisions

Line 11:

# The points of the eliminated candidate are proportionally redistributed in each vote (normalization).

By repeating processes 1 and 2, a worst candidate is ~~eliminate~~ each time.

By repeating processes 1 and 2, the worst candidate is eliminated each time.

The remaining candidates are the best (winners).

==Extended procedure==

==Extended procedure (single winner)==

It's the procedure indicated above in which:

* the votes are reversed before counting.

* the candidate with the highest sum of points is eliminated (instead of those with lowest sum).

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

Line 38:

===Digital ballot===

By using self-resizing sliders it's possible to obtain 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.

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 132:

Each voter, based on his own interests, creates the following 2 sets of candidates:

* Winner Set = set containing a ~~quantity~~ of favorite candidates equal to or less than the number of winners.

* Winner Set = set containing a number of favorite candidates equal to or less than the number of winners.

* Loser Set = set containing the candidates who aren't part of the Winner Set.

Line 172:

* isn't appropriate to manage seats with different weights.

For these reasons it's better to avoid using Surplus Handling in Distributed Voting System.

For these reasons, it's better to avoid using Surplus Handling in Distributed Voting System.

===Suitable for Web===