Pairwise counting: Difference between revisions
→Terminology
Line 289:
'''Pairwise champion''': Also known as a beats-all winner or [[Condorcet winner]], it is a candidate who pairwise beats every other candidate. Due to pairwise ties (see above) and pairwise cycling (see below), there is not always a pairwise champion.
'''Pairwise cycling:''' Also known as a [[Condorcet cycle]], it is when within a set of candidates, each candidate has at least one pairwise defeat (when looking only at the matchups between the candidates in the set).
'''Minimal pairwise dominant set''': Also known as the [[Smith set]], it is the smallest group of candidates who pairwise beat all others. The [[Pairwise champion|pairwise champion]] will always be the only member of this set when they exist.
| |||