Proportional Subset Voting: Difference between revisions
Corrected the example.
Aldo Tragni (talk | contribs) No edit summary |
Aldo Tragni (talk | contribs) (Corrected the example.) |
||
Line 3:
==Procedure==
Ballot use range [-MAX,MAX], also without 0. N is the number of winners.
For each vote, and for each subset of N candidates, the following procedure is applied, considering only the original ratings of the N candidates in the vote:
Line 15:
===Example===
The following example shows how scores S are obtained from
Original vote, with range [-4,4]:
A[4] B[-4] C[0] D[2]
Subsets for N = '''2 winners'''
Converted vote:
Original vote, with range [-4,4]:
A[4] B[-4] C[0] D[2]
Subsets for N = '''3 winners'''
ABC: 4/1 + 0/2 + -4/4 = 3
ACD: 4/1 + 2/2 + 0/4 = 5
ABD: 4/1 + 2/2 + -4/4 = 4
BCD: 2/1 + 0/2 + -4/4 = 1
Converted vote:
ACD[5] ABD[4] ABC[3] BCD[1]
The following example shows how the sums for each subset are obtained, given the converted votes:
3 converted votes, with '''2 winners''':
Sums for each subset:
The winner is
==Subset Voting (category)==
Line 44 ⟶ 53:
N is the number of winners.
''In the converted votes, subsets are considered as single candidates with a score.''
▲Considering the subsets as single candidates, a Single-Winner system applicable on the converted votes, is used to obtain the winning subset.
''The
===Thiele method===
Thiele method uses range [0,MAX] and in p1 divides the values by <math>\begin{equation}i\end{equation}</math> with <math>\begin{equation}i=1,...,N\end{equation}</math>.
PSV uses range [-MAX,MAX] and in p1 divides the values by <math>\begin{equation}2^i\end{equation}</math> with <math>\begin{equation}i=0,...,N-1\end{equation}</math>.
[[Category:Single-winner voting methods]]
| |||