[EM] Simplest Condorcet method to hand count?

[Etjon Basha]

Good evening gentlemen,

I've been pondering the above issue, and already consulted Gemini who
disagrees with me on the practicality of pairwise matrices, so couldn't
help a lot.

I suspect that compiling pairwise matrices in the context of a hand counted
election would be very time consuming, and quite prone to errors and
challenges from all parties.

Assuming we agree on this (which you might not) is there any practical
Condorcet method can can be hand counted?

I suspect Nanson is a reasonable candidate. Yes, it still requires
log(candidates,2) counting rounds, and each of those rounds require sending
a matrix of how many times each candidate was ranked in which position to a
central location, so quite the bother indeed.

Yet, I suspect this task can at least be completed within acceptable
timeframes with an acceptable error rate by most volunteers.

(Interestingly, Gemini considers Copeland easier to hand count than Nanson,
which I disagree with)

Are there any simpler methods I'm unaware off, despite any other
shortcomings such a method might have?

Best regards,

Etjon
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20250522/3fa9d1ba/attachment.htm>