Information for "Ranked Pairs"

Basic information

Display titleRanked Pairs
Default sort keyRanked Pairs
Page length (in bytes)14,406
Namespace ID0
Page ID364
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page2
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>WikipediaBot
Date of page creation20:27, 26 January 2005
Latest editorKristomun (talk | contribs)
Date of latest edit16:51, 15 May 2024
Total number of edits37
Recent number of edits (within past 180 days)6
Recent number of distinct authors2

Page properties

Transcluded templates (12)

Templates used on this page:

SEO properties



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.
Information from Extension:WikiSEO