Information for "Sequential pairwise elimination"

Basic information

Display titleSequential pairwise elimination
Default sort keySequential pairwise elimination
Page length (in bytes)2,864
Page ID3503
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
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 creatorKristomun (talk | contribs)
Date of page creation09:40, 23 July 2022
Latest editorKristomun (talk | contribs)
Date of latest edit16:08, 28 July 2022
Total number of edits3
Total number of distinct authors1
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded template (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Sequential pairwise elimination is a class of voting methods devised by Forest Simmons. These methods elect from the Banks set and thus pass the Condorcet criterion...
Information from Extension:WikiSEO