Distributed Voting: Difference between revisions
Managing votes without 0 points, managing tie during the count, about Equal Vote
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) (Managing votes without 0 points, managing tie during the count, about Equal Vote) |
||
Line 19:
The remaining candidates are the winners. The sum of the points of the remaining candidates indicates the % of victory.
==Procedure specification==
===Example normalization of a vote===▼
▲===Example normalization of a single vote===
Given an initial vote of this type, with candidates A,B,C,D,E:
A[0]
A[0], B[10], C[30], D[60]▼
A[0]
▲A[0], B[100]
===Normalization of the vote===
Line 59 ⟶ 55:
===Managing votes with 0 points===
If the only candidate
# The vote is excluded from the count:
# The points are divided equally between the remaining candidates with 0 points:
Using procedure 2 you get a vote that:
Line 71 ⟶ 67:
For the reasons indicated above, it’s strongly discouraged to use procedure 2.
===Managing votes without 0 points===
If the only candidate C with 0 points is eliminated from a vote like this A[80] B[20] C[0], there are 2 forms that the vote can take:
# honest form: A[80] B[20]
# tactical form: A[100] B[0]
It's recommended to use the honest form, also because the vote from the beginning may not have candidates with 0 points (possible case).
===Managing tie during the count===
Cases of parity can occur during counting, as in the following example:
* Vote 1: A[50] B[25] C[25]
* Vote 2: A[50] B[25] C[25]
* Sum of votes: A[100] B[50] C[50]
In this case, the worst candidate is both B and C so you have to eliminate them simultaneously. The amount of points to be redistributed will be the sum of the points that had B and C (100 in the example).
==Other properties==
===Simplified voting writing===
Line 91 ⟶ 108:
The complexity in writing the vote adapts to the voter, and it’s also noted that, if 101 or 99 points are mistakenly distributed, the vote will still be valid.
===About Equal Vote===
Given a score with points distributed in the following order: A[50] B[30] C[15] D[5] E[0]
you can always get a counter-balancing by exchanging the order of the points: A[0] B[5] C[15] D[30] E[50]
Applying the count only considering the 2 votes defined above, you will always obtain equality between the two candidates to the extremes of the vote (in this example, equality between A and E).
These 2 votes in the end support only 2 candidates out of the initial 5, so adding those 2 votes to a tally with other votes, can change the results of the tally.
==Forum Debate==
| |||