| Display title | Talk:Ranked Pairs |
| Default sort key | Ranked Pairs |
| Page length (in bytes) | 3,171 |
| Namespace ID | 1 |
| Namespace | Talk |
| Page ID | 1841 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| 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 | 00:19, 28 February 2020 |
| Latest editor | Closed Limelike Curves (talk | contribs) |
| Date of latest edit | 04:26, 1 March 2024 |
| Total number of edits | 11 |
| Recent number of edits (within past 180 days) | 10 |
| Recent number of distinct authors | 2 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | I'd like to see if there's a way the calculation can be sped up even further. I think the key is that if we have, for example, a candidate with 1 pairwise defeat and no pairwise ties, and early on in the RP procedure this candidate's only defeat is ignored, then we automatically know they're the winner. So I'd like to suggest the following procedure: calculate the number of pairwise defeats for each candidate, and then run RP until at least one candidate has no defeats. If that candidate has pairwise ties, keep running RP, otherwise that candidate is the winner. BetterVotingAdvocacy (talk) 00:19, 28 February 2020 (UTC) |
