| Display title | Dodgson's method |
| Default sort key | Dodgson's method |
| Page length (in bytes) | 2,850 |
| Namespace ID | 0 |
| Page ID | 1805 |
| 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 | Psephomancy (talk | contribs) |
| Date of page creation | 16:03, 27 February 2020 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 14:06, 25 August 2020 |
| Total number of edits | 7 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Dodgson's method is a Condorcet method that ranks a candidate X according to the number of times adjacent candidates have to be swapped on a ballot (not necessarily the same ballot each time) to make X the Condorcet winner. The candidate with the least number of necessary swaps wins. |
