Talk:Pairwise counting: Difference between revisions

 
(6 intermediate revisions by 4 users not shown)
Line 113:
 
:: In the example in your second paragraph, we don't need negative counts to indicate a bullet voter; we can just say "A is marked on 1 ballot", and then we are done processing that ballot. The key thing I think you missed is that the unpacking happens at the central counting place using this approach, rather than in the precincts. So, for example, if there are 5 candidates, instead of the vote-counter marking A>B, A>C, A>D, A>E, the central counting place gets the information "A is marked on 1 ballot" and then they can unpack this by saying "OK so A must have gotten 1 vote in A>B, A>C, A>D, and A>E." Thus, the unpacking doesn't actually take any significant amount of work to do. Another thing that may have been misinterpreted is the negative count approach; you only need negative counts when a voter ranks one candidate above or equal to another candidate. So, for example, someone voting A>B only needs a negative vote recorded in B>A in order for us to figure out which matchups they don't prefer B in, because in all other matchups we know they prefer B, therefore we can just record that "B is marked on 1 ballot" and this one negative vote, which allows us to collectively say "B is preferred in every matchup except against A". Thus, it still only requires looking at the ballot once per candidate. Regarding your point in your third paragraph, it seems to me that it would always be significantly easier to record a bullet vote with only 1 marking rather than several? I made an example of this at https://www.reddit.com/r/EndFPTP/comments/fylh2p/how_are_elections_run_under_condorcet_reported/fn75b3g/ if it helps. A broader point I should mention is that, ignoring equal-rankings, this approach will always require at most a few more markings than the regular approach (at most it's the number of markings in the regular approach plus the number of candidates), and often will require far fewer. I'll show this for the 4-candidate case: if someone votes A>B>C>D, then in the usual approach, we do 3 markings for A's matchups, 2 for B's, and 1 for C's. With this approach, we do 4 markings, one for each candidate to indicate that they were ranked by the voter, and then we do 3 negative votes for D, 2 negatives for C, and 1 for B. Now, if this voter had only ranked A>B, then in the usual approach that's 3+2=5, whereas with this approach, it's 2+1=3. As the number of on-ballot candidates increase, the time-savings starts to possibly become worth it. Anyways, I think one thing we can probably agree on is that even if you're using the regular pairwise counting approach, it's smart to, for every voter who has only one 1st choice candidate, report the bullet votes for that candidate and skip counting that candidate's matchups, while still manually counting the matchups of all lower-ranked candidates. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 01:07, 15 April 2020 (UTC)
 
:: You added "However, it requires a post-processing stage to convert the Condorcet matrix into the more familiar form before usage by Condorcet methods." to a part of the page discussing how negative counting required less markings than the regular approach. I think you properly understand how negative counting works, but I'd just like to reiterate that this part of the procedure doesn't add any work for the vote-counters, and thus it doesn't work against the claim that negative counting requires less marks, or the general idea of it being less work. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 21:55, 22 May 2020 (UTC)
 
::: Yes, that's true. I simply meant to show that you don't get quite as much for free as it might seem like you're getting, particularly if the counts are computerized, because you have to add some numbers to correct the non-marked candidate counts at some point, however you do the precinct counts. [[User:Kristomun|Kristomun]] ([[User talk:Kristomun|talk]]) 12:11, 25 May 2020 (UTC)
:::: I'm not sure I understand what you mean by "correcting the non-marked candidate counts". But if you understand that this post-processing stage requires maybe a couple of minutes of work at most for regular elections, then that's good; I just wanted to clarify that the math can be done in 2 seconds by a computer (Excel spreadsheet with the value for number of voters ranking a candidate added to all other values in that row, which will be the number of voters ranking that candidate below another candidate in a head-to-head matchup) whereas the tallying in the precincts could take days, so it's not as big a caveat as the wording of the sentence might suggest. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 21:55, 27 May 2020 (UTC)
 
I ought to note that I just realized that simply counting 1st choices separately from all other ranks actually has the potential to rival the speedup produced by negative counting in many election scenarios. For Burlington 2009, for example, doing regular pairwise counting with the 1st choice trick is actually faster than negative counting. https://electowiki.org/wiki/Negative_vote-counting_approach_for_pairwise_counting#Burlington_2009_mayoral_election [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 21:14, 3 June 2020 (UTC)
 
== Wikipedia version of this topic ==
 
Over on Wikipedia there is a new article titled '''Pairwise vote counting''' waiting for approval, which, in turn, involves a split request. Here's the link to details:
 
https://en.wikipedia.org/wiki/Talk:Condorcet_method#Pairwise_Vote_Counting_article,_split_request
 
The draft version of the new article uses the relevant parts of this Electowiki article, plus the relevant parts in the '''Condorcet method''' article.
 
Apparently hardly anyone has the Wikipedia '''Condorcet method''' on their watchlist because no one has responded there. Thanks for any help. [[User:VoteFair|VoteFair]] ([[User talk:VoteFair|talk]]) 04:10, 29 August 2020 (UTC)
 
:I have it on my watchlist. I just chose not to respond to you. Please read [[wikipedia:WP:CANVAS]] and consider whether your instructions here are appropriate. -- [[User:RobLa|RobLa]] ([[User talk:RobLa|talk]]) 08:08, 29 August 2020 (UTC)
 
::Based on your info I edited the above comment to make it clear that I am not intending to request a specific approve or disapprove opinion, just that some opinions are needed. Is there a WikiProject for vote-counting methods? I didn't see one under "voting methods ...". If you know of one then I can ask there. Thanks! [[User:VoteFair|VoteFair]] ([[User talk:VoteFair|talk]]) 05:13, 1 September 2020 (UTC)
106

edits