Information for "Category:Sequential comparison Condorcet methods"

Basic information

Display titleCategory:Sequential comparison Condorcet methods
Default sort keySequential comparison Condorcet methods
Page length (in bytes)2,765
Namespace ID14
Page ID1773
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0

Category information

Total number of members1
Number of pages1
Number of subcategories0
Number of files0

Page protection

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

Edit history

Page creatorBetterVotingAdvocacy (talk | contribs)
Date of page creation16:44, 21 February 2020
Latest editorBetterVotingAdvocacy (talk | contribs)
Date of latest edit11:06, 19 April 2020
Total number of edits6
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
The Robert's Rules of Order pairwise elimination method is a prominent example of a sequential comparison method. Sequential comparison methods can all be described in the following manner: "order all candidates from first to last, eliminate the pairwise loser between the first two candidates in the order, and repeat until there is only one candidate remaining." All sequential comparison methods are Smith-efficient and thus Condorcet methods, because at least one Smith set member will remain uneliminated after each and every pairwise comparison (since a Smith member can't lose a matchup against a non-Smith member, and a matchup between two Smith members always leaves one Smith member uneliminated). These methods can also be called "Sequential pairwise" methods or any number of other names reflecting that they are based on eliminating the loser of a runoff.
Information from Extension:WikiSEO