Iterated Bucklin: Difference between revisions
Detail and properties of the multi-winner application
m (link to existing page on repeated balloting) |
(Detail and properties of the multi-winner application) |
||
Line 23:
== Multi-winner generalization ==
The same procedure can be generalized to the election of a number of winning candidates. At the first stage, all candidates with at least a quota of support (first preferences) are declared elected, and a
In keeping with the method’s mimicking of a sound strategy, support from an elected candidate would first be removed from those votes that have no more candidates left to elect (have already elected all those they approve of), and only afterward (if a quota of support has not been filled yet) from other voters who still approve of as yet unelected candidates.
It is noteworthy to highlight that once the iterative procedure begins, it is not possible for a candidate to be elected whilst some of their votes have not being counted yet, an eventuality which can happen in most other ranked counts such as [[Bucklin voting|Bucklin]] or the [[Single Transferable Vote]]. The avoidance of the issues raised by such possibility has led in the latter system to the development of the complex Meek and Warren counts. Nevertheless, when applied to a multi-winner scenario, Iterated Bucklin can still elect a candidate before all of their votes are counted before the iterative procedure starts (i.e. whenever a candidate is elected based on receiving a quota of support of first preferences only.).
=== Surplus Handling ===
| |||