Pairwise preference: Difference between revisions

No edit summary
Line 1:
Pairwise preferences are voters' preferences between pairs of candidates (their preferences in head-to-head matchups between candidates). [[Pairwise counting]] is used to extract this information from voters' [[ballot]]<nowiki/>s, and it is then used in all [[:Category:Pairwise counting-based voting methods|Category:Pairwise counting-based voting methods]], which are mostly just the [[Condorcet methods]], to help determine the winner of the election.
 
== Definitions ==
Line 10:
'''Pairwise winner''' and '''pairwise loser''': The candidate who pairwise wins a matchup is the pairwise winner of the matchup (not to be confused with the pairwise champion; see the definition two spots below). The other candidate is the pairwise loser of the matchup. (Note that sometimes "pairwise loser" is also used to refer to a [[Condorcet loser]], which is a candidate who is pairwise defeated in all of their matchups).
 
'''Pairwise tie''': Occurs when two candidates receive the same number of votes in their pairwise matchup. (Note that sometimes it is also called a tie when there is pairwise cycling, though this is different; see the definition two spots below.) Note that some cycles can be symmetrical ties i.e. you can swap the candidates' names without changing the result. (See the [[Condorcet paradox]] article for an example, and the [[neutrality criterion]] and [[tie]] for more information).
 
'''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). Note that some cycles can be symmetrical i.e. you can swap the candidates' names without changing the result. (See the [[Condorcet paradox]] article for an example, and the [[neutrality criterion]] for more information). Such cycles are sometimes called ties.
 
'''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]] will always be the only member of this set when they exist.
Line 38:
Cardinal methods can be counted using pairwise counting by comparing the difference in scores (strength of preference) between the candidates, rather than only the number of voters who prefer one candidate over the other. See the [[rated pairwise preference ballot]] article.
 
Note that pairwise counting can be done either by looking at the margins expressed on a voter's ballot, or the "winning votes"-relevant information (see [[Defeat strength]]). For example, a voter who scores one candidate a 5 and the other a 3 on a rated ballot can either be thought of as giving those scores to both candidates in the matchup (winning votes-relevant information) or as giving 2 points to the first candidate and 0 to the second (only the margins). For ranked and choose-one ballots, both margins and winning votes approaches yield the same numbers, since a voter can only give maximal support to at most one candidate in the matchup.
 
Essentially, instead of doing a pairwise matchup on the basis that a voter must give one vote to either candidate in the matchup or none whatsoever, a voter could be allowed to give something in between (a partial vote) or even one vote to both candidates in the matchup (which has the same effect on deciding which of them wins the matchup as giving neither of them a vote, as it does not help one of them get more votes than the other).
 
The Smith set is then always full of candidates who are at least weak Condorcet winners i.e. tied for having the most points/approvals. Note that this is not the case if voters are allowed to have preferences that wouldn't be writable on a cardinal ballot i.e. if the max score is 5, and a voter indicates their 1st choice is 5 points better than their 2nd choice, and that their 2nd choice is 5 points better than their 3rd choice, then this would not be an allowed preference in cardinal methods, and thus it would be possible for a Condorcet cycle to occur. Also, if a voter indicates their 1st choice is 2 points better than their 2nd choice, that this likely automatically implies their 1st choice must be at least 2 points better than their 3rd choice, etc. So there seems to be a [[transitivity]] of strength of preference, just as there is a transitivity of preference for rankings.<ref>{{Cite web|url=https://www.reddit.com/r/EndFPTP/comments/fcexg4/score_but_for_every_pairwise_matchup/|title=r/EndFPTP - Score but for every pairwise matchup|website=reddit|language=en-US|access-date=2020-04-24}}</ref>
 
== Notes ==
[[File:Pairwise counting table with links between matchups.png|thumb|444x444px|Green arrows point from the loser of the matchup to the winner. Yellow arrows indicate a tie. Red arrows (not shown here) indicate the opposite of green arrows (i.e. who lost the matchup).For example, the B>A matchup points to A>B with a green arrow because A pairwise beats B (head-to-head).]]
The [[rated pairwise preference ballot]] collectsallows the voter to express the most nuanced pairwise information of all [[ballot typetypes]].
 
Pairwise preferences can be used to understand [[Weighted positional method]]<nowiki/>s and their generalizations (such as [[Choose-one voting]], [[Approval voting]], and [[Score voting]]), and [[:Category:Pairwise counting-based voting methods|Category:Pairwise counting-based voting methods]]. In the first 3 methods, a voter is interpreted as giving a degree of support to each candidate in a matchup. Even [[IRV]] can be understood in this way to some extent when observing its compliance with the [[dominant mutual third]] property.
 
It may help to putinterpret pairwise data by putting the % of the votes a candidate got in the pairwise matchup. So, for example:
{| class="wikitable"
|+
Line 65:
| ---
|}
Multi-winner methods that use pairwise counting, such as [[CPO-STV]] and [[Schulze STV]], instead of doing pairwise matchups between individual candidates, do pairwise matchups between sets of candidates (called [[winner setsset]]<nowiki/>s).
 
 
s.