Expanding Approvals Rule: Difference between revisions
m
Add other Bucklin multiwinner methods
(→Notes) |
m (Add other Bucklin multiwinner methods) |
||
Line 45:
One possible way to elect A and D here might be to somehow use EAR to apportion seats to groups of voters (i.e. guarantee that the 20 B>C voters will get both seats on account of them being able to split into two groups of 10, larger than any other group), then rerun the election (with a new reduced quota, A and D are each the 1st choices of half of the voters and would thus win). Such an idea might be best implemented by using a [[Highest averages method|highest averages method]] to reweight ballots, similar to [[SPAV]].
Quota could be reduced by accounting for exhausted ballots. Quota = (total preferences in first n ranks)/(n*(k+1))
== See also ==
* [[Evaluative Proportional Representation]]
* [[Maximum Constrained Approval Bucklin]]
== References ==
| |||