Sequential Ebert: Difference between revisions

no edit summary
(Completed description of the method with an example)
No edit summary
 
(3 intermediate revisions by 3 users not shown)
Line 3:
Each elected candidate has a “load” of 1 that is spread equally among their approvers (every elected candidate must be approved by at least one voter), and each newly elected candidate is the one which minimises the sum of the squared voter loads given the candidates already elected.
 
The candidate with the most approvals always minimises the sum of the squared loads for a single winner, so is elected first. In the following example, there are three voters, and A, B and C are candidates. Two candidates are to be elected. The approval ballots are as follows:<blockquote>2 voters: A, B
 
 
1 voter: C</blockquote>A and B are tied for the most approvals, so one of these would be elected at first.
The candidate with the most approvals always minimises the sum of the squared loads for a single winner, so is elected first. In the following example, there are three voters, and A, B and C are candidates. Two candidates are to be elected. The approval ballots are as follows:<blockquote>2 voters: A, B
2 voters: A, B
 
1 voter: C
1 voter: C</blockquote>A and B are tied for the most approvals, so one of these would be elected at first.
 
The sum of the squared voter loads for electing either A or B would be 2*(1/2)^2 + 1*(0/1)^2 = 0.5.
Line 18 ⟶ 22:
 
Although candidate B has more total approvals than candidate C, candidate C is elected second, because electing C along with the already elected A gives a lower total sum of squared voter loads than electing B along with A.
[[Category:Approval PR methods]]