Distributed Voting: Difference between revisions
m
no edit summary
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) mNo edit summary |
||
Line 4:
[[File:DV Procedure.svg|alt=DV procedure|350px|thumb|DV procedure]]
# The point for each candidate are summed, and the one with the lowest sum is eliminated.
#
By repeating
The remaining candidates are the winners.
Line 85:
===Procedure variant (discouraged)===
One or more of the following procedures are used:
* 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.▼
▲* 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 166 ⟶ 168:
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.
In the last example
==Systems comparison==
Line 181 ⟶ 183:
By distributing points between 3 or more candidates, the Distributed Voting becomes increasingly different from the [[IRV]], because of normalization in the counting.
==Related Systems ==
* [[Distributed Multi-Voting]] (particular vote conversion)
* [[Baldwin's method]] (ranking candidates)
* [[Cumulative voting]] (no insta-runoff)
==Forum Debate==
| |||