| Display title | Raynaud |
| Default sort key | Raynaud |
| Page length (in bytes) | 3,534 |
| Namespace ID | 0 |
| Page ID | 368 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | 12.73.132.31 (talk) |
| Date of page creation | 05:06, 23 March 2005 |
| Latest editor | Sass (talk | contribs) |
| Date of latest edit | 05:45, 18 November 2021 |
| Total number of edits | 17 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
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] |
