| Display title | Iterated Bucklin |
| Default sort key | Iterated Bucklin |
| Page length (in bytes) | 9,046 |
| Namespace ID | 0 |
| Page ID | 3034 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | Arqiduka (talk | contribs) |
| Date of page creation | 13:03, 18 April 2021 |
| Latest editor | Arqiduka (talk | contribs) |
| Date of latest edit | 09:28, 8 February 2024 |
| Total number of edits | 11 |
| Recent number of edits (within past 180 days) | 1 |
| Recent number of distinct authors | 1 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Iterated Bucklin (alternatively Bucklin-IRV, or BIRV) is a ranked Approval count, a variant of Bucklin voting whereby the number of top preferences an individual ballot reveals at any point is a function of the rank in which the ballot places the winner of the count so far. This modifies the standard Bucklin voting procedure by which all ballots reveal the same, progressively increasing number of top preferences until a quota of support is filled by at least one candidate. |
