Raynaud: Difference between revisions
Content added Content deleted
No edit summary |
m (Fix error: 3-candidate Raynaud is not Minmax.) |
||
| Line 1: | Line 1: | ||
'''Raynaud''' or '''Pairwise-Elimination''' is a [[Condorcet criterion|Condorcet method]] in which the loser of the strongest pairwise defeat is repeatedly eliminated until only one candidate remains. 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''). |
'''Raynaud''' or '''Pairwise-Elimination''' is a [[Condorcet criterion|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''). |
||
Raynaud fails the [[Monotonicity criterion]]. Even when winning votes are used as the measure of defeat strength, Raynaud fails the [[Plurality criterion]] and the [[Strong Defensive Strategy criterion]]. |
Raynaud fails the [[Monotonicity criterion]]. Even when winning votes are used as the measure of defeat strength, Raynaud fails the [[Plurality criterion]] and the [[Strong Defensive Strategy criterion]]. |
||
| Line 8: | Line 8: | ||
[[Category:Single-winner voting methods]] |
[[Category:Single-winner voting methods]] |
||
[[Category: |
[[Category:Sequential loser-elimination methods]] |
||
[[Category:Smith-efficient Condorcet methods]] |
[[Category:Smith-efficient Condorcet methods]] |
||