In
voting systems, the
Smith set is the smallest set of candidates in a particular election who, when paired off in pairwise elections, can beat all other candidates outside the set. In most elections, this set usually consists of only one candidate. However, sometimes when the electorate is conflicted (as in
Condorcet's paradox), the set has at least one cycle of candidates for whom A beats B, B beats C, and C beats A.
All Wikipedia text
is available under the
terms of the GNU Free Documentation License