Raynaud: Difference between revisions

Content added Content deleted

Inline

Revision as of 05:06, 23 March 2005 (view source) 12.73.132.31 (talk) No edit summary		Revision as of 15:31, 24 March 2005 (view source) 12.73.130.13 (talk) No edit summary Newer edit →
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. ~~Usually, defeat~~ strength is measured as the absolute number of votes cast for the winning side.		'''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'').

	In ~~contrast~~ to ~~most~~ ~~other~~ ~~Condorcet~~ ~~methods using~~ winning votes as ~~the~~ ~~measure~~ ~~of defeat strength, Raynaud~~ fails the [[~~Plurality~~ criterion]]. It ~~also fails~~ the [[~~Monotonicity~~ criterion]].		Raynaud fails the [[Plurality criterion]], even when winning votes is used. It also fails the [[Monotonicity criterion]]. It satisfies the [[Smith set\|Smith criterion]].