Proportional Subset Voting: Difference between revisions
m
no edit summary
Aldo Tragni (talk | contribs) (Correction of the procedure) |
mNo edit summary |
||
Line 3:
==Procedure==
Ballot uses range [0%,100%]. <math>
For each vote, and for each subset of <math>
* create a list of <math>
* for each <math>
* find the group with the lowest percentage <math>
* find the group with the highest percentage <math>
Sort the subsets from major to minor based on the <math>
If there are any tied subsets, <math>
===Procedure with range===
Line 24:
The only difference with the procedure that uses multiple-choice ballots is that:
* the total approval of a voter for N candidates must be somehow rounded up to a multiple of <math>
==Example==
Line 54:
Short: 66%['''33%'''] 83%['''66%''']
Find <math>
ABCDEG: {33%,83%}
|