User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting: Difference between revisions

# Math: The final number of votes for the first candidate against the second candidate in each head-to-head matchup is then found by, if treating the second value as a positive number, subtracting the second value for the first candidate from the first value (addition is done instead of subtraction if the second value is treated as a negative number).

#* This can be succinctly summarized as, for finding the vote totals in a matchup between candidates A and B:<blockquote>A>=B = A - A<B</blockquote>meaning that the number of ballots ranking A over or (explicitly) equal to B, is equal to the number of ballots ranking A, minus the number of ballots ranking A below B (i.e. B over A).

 

The number of ballots marking each candidate can be placed in the blank cell comparing themselves to themselves in the pairwise matrix i.e. for candidate A, the cell A>A would contain the number of voters ranking A.<ref>{{Cite web|url=https://www.reddit.com/r/EndFPTP/comments/fsa4np/possible_solution_to_the_condorcet_writein_problem/|title=Possible solution to the Condorcet write-in problem|last=|first=|date=|website=|url-status=live|archive-url=|archive-date=|access-date=}}</ref>