Distributed Voting: Difference between revisions
m
no edit summary
Aldo Tragni (talk | contribs) mNo edit summary |
Aldo Tragni (talk | contribs) mNo edit summary |
||
Line 47:
*using procedure 2, B would win.
V1 likes A and B almost in the same way, so the victory of B would make both V1 and V2 happy. For this reason it's recommended to use procedure 2, which keeps the voter's
===Vote with only 0 points===
Line 74:
The tie can be managed in various ways:
*delete C first,
*delete C and D at the same time.
*randomly delete C or D.
Line 82:
===Procedure variant (discouraged)===
One or more of the following
* When the worst is eliminated, the candidates with the lowest score among those left in the vote must be set to 0, and then normalizes.
* [[Surplus Handling]] (in the standard Distributed Voting it's not used).
* If the remaining candidates are contained in a [[Smith set]], then the candidates with the highest sum wins.
==Other properties==
Line 124:
'''Multiple winner'''
Satisfy the [[Honesty criterion]] (on hypotheses) only if, in a vote, are removed first
===Equality===
Line 131:
* In the Distributed Voting the voters at the beginning all have 100 points to distribute according to their preferences, therefore Equality is satisfied.
* During all the counting steps, through the use of normalization, it ensures that all voters continue to have 100 points each, always distributed according to their initial interests, therefore Equality is satisfied.
* The result is one of the counting steps, in which Equality continues to be satisfied.
Line 149:
* cancel the [[Distributed Voting#Equality|Equality]] in some steps of the count.
* increase the complexity of the counting.
* if a voter votes A[99] B[1] C[0]
For these reasons it's better to avoid using Surplus Handling in Distributed Voting.
| |||