| Display title | Talk:Instant-Round-Robin Voting |
| Default sort key | Instant-Round-Robin Voting |
| Page length (in bytes) | 1,068 |
| Namespace ID | 1 |
| Namespace | Talk |
| Page ID | 3930 |
| 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 | Kristomun (talk | contribs) |
| Date of page creation | 11:20, 20 March 2024 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 11:20, 20 March 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 180 days) | 1 |
| Recent number of distinct authors | 1 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | I looked through my Condorcet Yahoo list archives to find a definition for this article's method, but it's all rather vague. The closest I could find was RM Harman's post which first suggests a possible "inner Condorcet method" based on a bubble sort. It then defines a more general outer method where first, candidates who are both pairwise and approval beaten by someone else are eliminated, and then the inner method is used. He suggests that any Condorcet method could be used as an inner method. |
