Pairwise counting: Difference between revisions

Added heading and refined wording
(Added heading and refined wording)
Line 120:
| align="left" | 17%
|}
 
== Election examples ==
Here is an example of a pairwise victory table for the [https://en.wikipedia.org/wiki/2009_Burlington_mayoral_election Burlington 2009] election:
{| class="wikitable"
Line 209 ⟶ 211:
The following terms are often used when discussing pairwise counting:
 
'''Pairwise win/beat''' and '''pairwise lose''': When one candidate receives more votes in a pairwise matchup/comparison against another candidate, theythe former candidate "pairwise beatbeats" thatthe latter candidate, withand the otherlatter candidate in the matchup "pairwise losingloses."
 
'''Pairwise winner''' and '''pairwise loser''': theThe candidate who pairwise wins is the pairwise winner of the matchup,. with theThe other candidate beingis the pairwise loser of the matchup.
 
'''Pairwise tie''': WhenOccurs when two candidates receive the same number of votes in their pairwise matchup.
 
'''Pairwise order/ranking''': Also known as a [[Condorcet ranking]], it is athe ranking of candidates such that each candidate is ranked above all candidates they pairwise beat. OneSometimes such a ranking does not always exist due to the [[Condorcet paradox]],. thoughAs a related concept, there is always a [[Smith set ranking|Smith ranking]] whichthat moreapplies generally holds instead forto groups of candidates.
 
==Notes==
106

edits