| Display title | Ranked Pairs |
| Default sort key | Ranked Pairs |
| Page length (in bytes) | 14,406 |
| Namespace ID | 0 |
| Page ID | 364 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 57 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>WikipediaBot |
| Date of page creation | 20:27, 26 January 2005 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 16:51, 15 May 2024 |
| Total number of edits | 37 |
| 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. | The "Ranked Pairs" method (sometimes abbreviated as "RP") was created in 1987 by Nicolaus Tideman.[1] It is a voting system that selects a single winner using votes that express preferences. The ranked-pairs method can also be used to create a sorted list of winners. Ranked Pairs passes the Smith criterion and the Condorcet winner criterion (thus making it a "Condorcet method"). The ranked-pairs method has many variations such as the "Maximize Affirmed Majorities" (or "MAM") and "Maximum Majority Voting" (or "MMV") voting methods. |
