Information for "User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting"

Basic information

Display titleUser:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting
Default sort keyBetterVotingAdvocacy/Negative vote-counting approach for pairwise counting
Page length (in bytes)65,447
Namespace ID2
NamespaceUser
Page ID2425
Page content languageen - English
Page content modelwikitext
User ID60
Indexing by robotsAllowed
Number of redirects to this page1
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorBetterVotingAdvocacy (talk | contribs)
Date of page creation09:00, 15 May 2020
Latest editorBetterVotingAdvocacy (talk | contribs)
Date of latest edit23:07, 15 February 2022
Total number of edits58
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded template (1)

Template used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The negative counting approach is an alternative method of doing pairwise counting. Whereas regular pairwise counting operates from the perspective that a candidate ("Candidate A") ranked by a voter is not preferred over any other candidates except any candidates ranked below Candidate A by that voter, negative pairwise counting operates from the opposite perspective, which is that Candidate A is preferred over every other candidate except any candidates ranked above (and optionally, equally to) Candidate A by that voter. Both approaches give the same final pairwise vote totals for an election (except in elections allowing equal-ranking and/or write-in candidates, depending on how those are counted). An example of how the information garnered by negative pairwise counting is translated into a final pairwise total: if it is known that a) 5 voters ranked a "Candidate B" on their ballots, and b) only 3 of these voters ranked Candidate B below or equal to "Candidate C", then logically, the other 2 voters must have ranked Candidate B above Candidate C.
Information from Extension:WikiSEO