Distributed Score Voting: Difference between revisions

# All head-to-head matches are conducted between candidates. In head-to-head, the candidate who has more points in a vote than his opponent receives W points from the vote. The candidate who gets the most points wins the head-to-head. Graphically, each candidate is a node; the head-to-head is represented by an arrow, leaving the winning candidate, entering the losing candidate. The tie is represented as a double arrow entering, that is both candidates are considered losers.

# Find the smallest set X of nodes that don’t have incoming arrows, coming from outside the set. Then remove all candidates not in X from the votes.

# Convert the marks into a range form, assigning 0 points to the candidates with the lowest score and normalizing* the remaining candidates, using the following formula: M = candidate with the highest score, before normalization. v0 = current value of candidate C, to be normalized. v1 = value of candidate C, after normalization.

# Add up the points for each candidate of the range votes, and the candidate who has the highest sum, wins. The choice of the single winner ends here.

# If you want to have more winners, then remove the single-winner from all original votes, repeating the whole procedure from point 1. The value W of each original vote is reduced by the points assigned to the removed candidate. By repeating this process several times, I can get as many winners as I like, which will be those removed in point 5.

# If you want to know the % of victory of the winning candidates then, in each original vote, you must remove all the candidates who haven’t won, and normalize* the vote with the formula used in point 3 (with W=100 fixed). The sum of points for each candidate will indicate the % of victory.