| Latest revision |
Your text |
| Line 1: |
Line 1: |
| - | {{task|completed}} | + | {{task|proposed}} |
| | | | |
| | | | |
| | Due to the noise generated by the voting procedure from the first election, the procedure needs to be reevaluated and a better system needs to be put in place for the next election. | | Due to the noise generated by the voting procedure from the first election, the procedure needs to be reevaluated and a better system needs to be put in place for the next election. |
| | | | |
| - | == Proposal: RRV ==
| |
| - | [http://scorevoting.net/RRV.html Background from scorevoting.net]
| |
| - |
| |
| - | I've added a description of [http://en.wikipedia.org/wiki/Range_voting#Reweighted_range_voting RRV] to Wikipedia. Since TeX isn't enabled here, it's easiest to read it there. (Provided, of course, it remains intact...)
| |
| - |
| |
| - | The proposal is edited for html legibility and simplicity below, but should be a complete specification.
| |
| - |
| |
| - | === Variables ===
| |
| - | *''l'': number of voters
| |
| - | *''m'': number of candidates
| |
| - | *''n'': number of seats
| |
| - | *''i'': index of voters (1 ≤ ''i'' ≤ ''l'')
| |
| - | *''j'': index of candidates (1 ≤ ''j'' ≤ ''m'')
| |
| - | *''k'': index of seats (and rounds) (1 ≤ ''k'' ≤ ''n'')
| |
| - | === Parameters ===
| |
| - | An unbalanced normalized range is to be used, ranging from 0 to 1.
| |
| - |
| |
| - | A ballot from voter ''i'' consists of ''m'' ratings ''a<sub>ij</sub>'' for the ''m'' candidates, such that 0 ≤ ''a<sub>ij</sub>'' ≤ 1.
| |
| - |
| |
| - | === Procedure ===
| |
| - | After all ballots are collected, ''n'' rounds are held to choose the winners ''w<sub>k</sub>'', with one winner chosen per round. In the first round, the weighted ratings for each voter are initialized as ''b<sub>ij1</sub> = a<sub>ij</sub>''. The weighted scores in each round are summed:
| |
| - |
| |
| - | ''B<sub>jk</sub>'' = ∑<sub>''i''∈(1…''l'')</sub>'' b<sub>ijk</sub>''
| |
| - |
| |
| - | The highest-scoring candidate not yet elected wins; this is not simple to express formally:
| |
| - |
| |
| - | ''w<sub>k</sub>'' = max ( ''B<sub>jk</sub>'' s.t. ''j'' ∉ ''w''<sub>1…(''k''-1)</sub>)
| |
| - |
| |
| - | The weighted scores for each succeeding round are calculated by de-emphasizing ballots according to the portion in which they've already won:
| |
| - |
| |
| - | ''b''<sub>''ij''(''k''+1)</sub>=''a<sub>ij</sub>'' / ( 1 + ∑<sub>''p''∈(1…''k'')</sub> ''a<sub>iw<sub>p</sub></sub>'' )
| |
| - |
| |
| - | == Proposal: Single Transferable Vote ==
| |
| - |
| |
| - | Notation:
| |
| - | * N seats available
| |
| - | * C candidates running
| |
| - | * T total valid votes cast in the election
| |
| - | * Q (the quota) = floor(T/(N+1) + 1)
| |
| - |
| |
| - | [http://en.wikipedia.org/wiki/Single_transferable_vote Single transferable vote] is the voting system used in Ireland's general elections, with multi-seat constituencies resembling a Maemo Community Council vote - there are N places and C candidates, with C > N. There is an added advantage of having [http://stv.sourceforge.net/ software available to count STV].
| |
| - |
| |
| - | The voting system is simple from the voter's point of view - you vote in order of preference for one or more of the candidates. If you only have a first preference, you vote only 1 for your choice. If you have a second preference, you give him number 2, and you continue like this down the ballot, as far as you care to go.
| |
| - |
| |
| - | Counting is also quite simple. We first count all the number 1 votes, and rank the candidates in order. If any candidates have more than T/(N+1) votes, they are deemed elected. Their surplus votes (the votes over the quota Q) are redistributed according to the weighings of their second preferences.
| |
| - |
| |
| - | If no-one has been deemed elected, or all surpluses have been distributed, the candidate with the least first preferences is eliminated, and his votes are redistributed according to the second preference.
| |
| - |
| |
| - | This process is repeated until N candidates are deemed elected, or until there are only 2 unelected candidates remaining. In this situation, the candidate with the highest number of votes is deemed elected without having reached the quota.
| |
| - |
| |
| - | A simple example will illustrate:
| |
| - |
| |
| - | 4 candidates (A, B, C), 2 seats, 11 votes, the quota is thus 4 votes.
| |
| - |
| |
| - | # A, B
| |
| - | # A, C
| |
| - | # A
| |
| - | # A, B, C
| |
| - | # B, C
| |
| - | # B, A
| |
| - | # B, C
| |
| - | # C
| |
| - | # C, A
| |
| - | # C
| |
| - | # D, C
| |
| - |
| |
| - | 1st count:
| |
| - | * A: 4
| |
| - | * B: 3
| |
| - | * C: 3
| |
| - | * D: 1
| |
| - |
| |
| - | A is deemed elected, and D is eliminated.
| |
| - |
| |
| - | D's 2nd preferences give 1 vote to C.
| |
| - |
| |
| - | 2nd count:
| |
| - | * A: 4
| |
| - | * B: 3
| |
| - | * C: 4
| |
| - |
| |
| - | A and C are deemed elected.
| |
| | | | |
| | == Discussions == | | == Discussions == |
| | | | |
| - | * [http://www.internettablettalk.com/forums/showthread.php?p=239338 Defining the Maemo Community Council voting procedure - Internet Tablet Talk] | + | * [http://www.internettablettalk.com/forums/showthread.php?p=239338|Defining the Maemo Community Council voting procedure - Internet Tablet Talk] |
| | | | |
| | [[Category:Community]] | | [[Category:Community]] |
| | [[Category:maemo.org]] | | [[Category:maemo.org]] |
| - | [[Category:Community Council]] | + | [[Category:Council]] |
