| Display title | Young's method |
| Default sort key | Young's method |
| Page length (in bytes) | 3,167 |
| Namespace ID | 0 |
| Page ID | 2804 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| 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 | Kristomun (talk | contribs) |
| Date of page creation | 21:12, 22 August 2020 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 12:25, 25 August 2020 |
| Total number of edits | 6 |
| 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. | Young's method is a Condorcet method that elects the candidate that can be made into a Condorcet winner by ignoring as few ballots as possible. It was devised by H. P. Young in 1977.[1] |
