| Display title | Condorcet with dual dropping |
| Default sort key | Condorcet with dual dropping |
| Page length (in bytes) | 1,332 |
| Namespace ID | 0 |
| Page ID | 3372 |
| 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 | Kristomun (talk | contribs) |
| Date of page creation | 15:41, 23 April 2022 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 15:41, 23 April 2022 |
| Total number of edits | 1 |
| 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. | Condorcet with dual dropping is a Condorcet method that determines the social order (ranking of candidates) by Schulze and Ranked pairs, and returns the social order with the smallest Kemeny distance.[1][2] |
