Information for "Raynaud"

Basic information

Display titleRaynaud
Default sort keyRaynaud
Page length (in bytes)3,534
Namespace ID0
Page ID368
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
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 creator12.73.132.31 (talk)
Date of page creation05:06, 23 March 2005
Latest editorSass (talk | contribs)
Date of latest edit05:45, 18 November 2021
Total number of edits17
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.
Raynaud, Arrow-Raynaud's method[1] or Pairwise-Elimination is a Condorcet method in which the loser of the strongest pairwise defeat is repeatedly eliminated until only one candidate remains. Raynaud can also be described as the sequential loser-elimination method that uses Minmax as its base method. Defeat strength is usually measured as either the absolute number of votes cast for the winning side (winning votes), or the number of votes for the winning side minus those for the losing side (margins). It was devised by Hervé Raynaud.[1]
Information from Extension:WikiSEO