| Display title | Talk:Kemeny–Young method |
| Default sort key | Kemeny–Young method |
| Page length (in bytes) | 915 |
| Namespace ID | 1 |
| Namespace | Talk |
| Page ID | 1935 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| 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 | BetterVotingAdvocacy (talk | contribs) |
| Date of page creation | 22:57, 17 March 2020 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 19:41, 20 August 2020 |
| Total number of edits | 3 |
| 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. | User:VoteFair, does Kemeny-Young have any variants that consider the possibility of an equal ranking of the candidates? For example, with 3 candidates, A, B, and C, does Kemeny-Young limit itself to considering the distance scores for the rankings A>B>C, A>C>B, B>C>A, B>A>C, C>A>B, C>B>A, or could it also consider the possibility of, say, A=B>C or B=C>A? |
