4,193
edits
Glossary: Difference between revisions
The start of a properly alphabetized glossary. Linking to categories that are filled with stuff
(Adapting text from Pairwise preference#Definitions (copying from https://electowiki.org/w/index.php?title=Pairwise_preference&oldid=11241 )) |
(The start of a properly alphabetized glossary. Linking to categories that are filled with stuff) |
||
Line 7:
== Definitions ==
* '''Pairwise''' — evaluating two candidates at a time. The following terms are often used when discussing pairwise preferences:{{see also|Pairwise preference#Definitions}}▼
* C
** [[:Category:Condorcet-related concepts|Condorcet-related concepts]]
* G
** [[Graph theory]]
* M
** '''Minimal pairwise dominant set''': Also known as the [[Smith set]], it is the smallest '''dominating set''', which is any group of candidates who beat all candidates not in the group. The [[pairwise champion]] will always be the only member of this set when they exist. ▼
*** Note that the terms '''dominating/dominant''' are often used as shorter versions of pairwise-dominant. ▼
* O
** [[Order theory]]
* P
▲** '''
** '''Pairwise matchup''': Also known as a head-to-head matchup, it is when voters are asked to indicate their preference between two candidates or winner sets, with the one that voters prefer (i.e. give more votes to) winning. It is usually done on the basis of majority rule (i.e. if more voters prefer one candidate over the other than the number of voters who have the opposing preference, then the candidate preferred by more voters wins the matchup) using [[choose-one voting]], though see the [[Strength of preference]] section for alternative ways. Pairwise matchups can be simulated from ranked or rated ballots and then assembled into a table to show all of the matchups simultaneously.
** '''Pairwise win/beat''' and '''pairwise lose/defeated''': When one candidate receives more votes in a pairwise matchup/comparison against another candidate, the former candidate "pairwise beats" the latter candidate (is "pairwise preferred" to the latter candidate), and the latter candidate "pairwise loses." Often this is represented by writing "Pairwise winner>Pairwise loser"; this can be extended to show a [[beatpath]] by showing, for example, "A>B>C>D", which means A pairwise beats B, B pairwise beats C, and C pairwise beats D (though it may or may not be the case, depending on the context, that, for example, A pairwise beats C).
Line 14 ⟶ 25:
** '''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 '''dominating set''', which is any group of candidates who beat all candidates not in the group. The [[pairwise champion]] will always be the only member of this set when they exist.
▲*** Note that the terms '''dominating/dominant''' are often used as shorter versions of pairwise-dominant.
** '''Pairwise order/ranking''': Also known as a [[Condorcet ranking]], it is a ranking of candidates such that each candidate is ranked above all candidates they pairwise beat. Sometimes such a ranking does not exist due to the [[Condorcet paradox]]. As a related concept, there is always a [[Smith set ranking|Smith ranking]] that applies to groups of candidates, and which reduces to the Condorcet ranking when one exists.
* S
** [[Set theory]]
[[Category:Vocabulary|*]]
| |||