Jump to content

Smith criterion: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m moved Generalized Condorcet criterion to Smith criterion: slightly more used
No edit summary
Line 1: Line 1:
The '''Generalized Condorcet criterion''' or '''Smith criterion''' for a [[voting system]] is that it picks the winner from the [[Smith set]], the smallest set of candidates such that every member of the set is preferred to every candidate not in the set. One candidate is preferred over another candidate if, in a one-on-one competition, more voters prefer the first candidate than prefer the other candidate.
The '''Smith criterion''' (or '''generalized Condorcet criterion''') is a [[voting system criteria]] defined such that its satisfaction by a [[voting system]] occurs when the system always picks the winner from the [[Smith set]], the smallest set of candidates such that every member of the set is pairwise preferred to every candidate not in the set. One candidate is pairwise preferred over another candidate if, in a one-on-one competition, more voters prefer the first candidate than prefer the other candidate.


Any election method that complies with the Generalized Condorcet criterion also complies with the [[Condorcet criterion]], since if there is a Condorcet winner, then that winner is the only member of the Smith set.
Any election method that complies with the Smith criterion also complies with the [[Condorcet criterion]], since if there is a Condorcet winner, then that winner is the only member of the Smith set. Obviously, this means that failing the Condorcet criterion automatically implies the non-compliance with the Smith criterion as well.


== Complying methods ==
== Complying methods ==


Among methods that comply with the Condorcet criterion, the [[Schulze method]] and [[Ranked Pairs]] comply with the Generalized Condorcet Criterion.
Among methods that comply with the Condorcet criterion, the [[Schulze method]] and [[Ranked Pairs]] comply with the Smith Criterion. Compliance with the Smith criterion can be "forced" by explicitly applying a voting system to the Smith set. For example, '''Smith/Minimax''' is the application of [[Minimax Condorcet|Minimax]] to only the candidates inside the Smith set.

Methods that do not comply with the Condorcet criterion, such as [[Approval voting]], [[Cardinal Ratings]], [[Borda count]], [[Plurality voting]], and [[Instant-Runoff Voting]], do not with the Generalized Condorcet Criterion.</p>


== External links ==
== External links ==

Revision as of 04:40, 26 February 2006

The Smith criterion (or generalized Condorcet criterion) is a voting system criteria defined such that its satisfaction by a voting system occurs when the system always picks the winner from the Smith set, the smallest set of candidates such that every member of the set is pairwise preferred to every candidate not in the set. One candidate is pairwise preferred over another candidate if, in a one-on-one competition, more voters prefer the first candidate than prefer the other candidate.

Any election method that complies with the Smith criterion also complies with the Condorcet criterion, since if there is a Condorcet winner, then that winner is the only member of the Smith set. Obviously, this means that failing the Condorcet criterion automatically implies the non-compliance with the Smith criterion as well.

Complying methods

Among methods that comply with the Condorcet criterion, the Schulze method and Ranked Pairs comply with the Smith Criterion. Compliance with the Smith criterion can be "forced" by explicitly applying a voting system to the Smith set. For example, Smith/Minimax is the application of Minimax to only the candidates inside the Smith set.