Raynaud: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 5:
A variant called ''Raynaud(Gross Loser)'' does satisfy the [[Plurality criterion]]. It successively eliminates the candidate with the fewest votes for him in any pairwise contest. In this way, it is not possible to eliminate candidate ''A'' before candidate ''B'' when ''A'' has more first preferences than ''B'' has any preferences, since this situation means that the minimum number of votes for ''A'' in any contest is greater than the maximum number of votes for ''B'' in any contest. This variant was devised by Chris Benham.
== Notes ==
Raynaud does satisfy the [[Smith set|Smith criterion]]. This is because if all but one candidate in the Smith set is eliminated at any point in Raynaud, the remaining candidate will pairwise beat all other candidates (since all the other candidates are not members of the Smith set), therefore the final remaining member of the Smith set won't have any pairwise defeats and will be the final remaining candidate overall.
Raynaud passes [[ISDA]]. This is because Raynaud can be thought of as hinging a candidate's victory chances on the successive evaluation of the ordering of all defeats from strongest to weakest; since all candidates in the Smith set have no pairwise defeats to any candidates not in the Smith set, there is no way for Smith set candidates' elimination chances to be impacted by the existence or non-existence of andidates not in the Smith set.
[[Category:Single-winner voting methods]]
| |||