| Display title | Coombs' method |
| Default sort key | Coombs' method |
| Page length (in bytes) | 3,111 |
| Namespace ID | 0 |
| Page ID | 115 |
| 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 | imported>WikipediaBot |
| Date of page creation | 20:01, 26 January 2005 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 13:03, 28 September 2023 |
| Total number of edits | 15 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Coombs' method (or the Coombs rule)[1] is a ranked voting system created by Clyde Coombs used for single-winner elections. Similarly to instant-runoff voting, it uses candidate elimination and redistribution of votes cast for that candidate until one candidate has a majority of votes. Its difference from IRV lies in its elimination criterion: instead of eliminating the candidate ranked first by the fewest voters, it eliminates the candidate ranked last by the most. |
