| Display title | Category:Sequential comparison Condorcet methods |
| Default sort key | Sequential comparison Condorcet methods |
| Page length (in bytes) | 2,765 |
| Namespace ID | 14 |
| Namespace | Category |
| Page ID | 1773 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | BetterVotingAdvocacy (talk | contribs) |
| Date of page creation | 16:44, 21 February 2020 |
| Latest editor | BetterVotingAdvocacy (talk | contribs) |
| Date of latest edit | 11:06, 19 April 2020 |
| Total number of edits | 6 |
| 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 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. |
