| Display title | Pairwise counting |
| Default sort key | Pairwise counting |
| Page length (in bytes) | 16,602 |
| Namespace ID | 0 |
| Page ID | 1534 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | VoteFair (talk | contribs) |
| Date of page creation | 17:48, 14 January 2020 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 12:45, 22 February 2024 |
| Total number of edits | 87 |
| Recent number of edits (within past 180 days) | 3 |
| Recent number of distinct authors | 2 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Pairwise counting is the process of considering a set of items, comparing one pair of items at a time, and for each pair counting the comparison results. In the context of voting theory, it involves comparing pairs of candidates or winner sets (usually using majority rule) to determine the winner and loser of the pairwise matchup. This is done by looking at voters' (usually ranked or rated) ballots to count, for each pair of candidates, which one they indicated a preference for, if they did. The pairwise preference article discusses how pairwise comparison information can be used. |
