Display title | Benham's method |
Default sort key | Benham's method |
Page length (in bytes) | 7,593 |
Namespace ID | 0 |
Page ID | 53 |
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>MichaelOssipoff |
Date of page creation | 05:23, 10 June 2013 |
Latest editor | Kristomun (talk | contribs) |
Date of latest edit | 14:47, 14 July 2023 |
Total number of edits | 36 |
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. | Benham's method is a variation of instant-runoff voting independently invented by Chris Benham, David Hill, and Robert Loring.[1][2][3] The method calls for tabulating the first-choice of all voters on all ballots (as done with instant-runoff), but before each elimination check if there is an un-eliminated candidate who pairwise beats all other un-eliminated candidates, and elect them if they exist. |