Talk:Condorcet method: Difference between revisions

No edit summary
 
Line 33:
: If, as I argued above, the problem is the distinction of last rank, then the algorithm that fixes it should make it clear that that's what the problem is. You really only need a count of how many times candidate X is explicitly ranked. Then you observe that for any incoming new write-in (e.g. Joe in precinct y when summing up x and y's totals), the value of any missing X>Joe cell for precinct y is the number of voters who explicitly ranked X in that precinct. No negative numbers needed, and this works both for equal-rank and strict ranking, as long as an all-equal ballot is considered to explicitly rank every candidate on it.
: As for voting software not implementing write-ins, that could just as well be due to convenience or UX matters. Nobody made it an issue of importance to have write-in support, and so it doesn't get included. [[User:Kristomun|Kristomun]] ([[User talk:Kristomun|talk]]) 13:23, 14 May 2020 (UTC)
:: Could you check and see if I've accurately summarized your approach in [[Pairwise counting#Dealing with write-in candidates]]? [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 22:32, 14 May 2020 (UTC)