There are many Condorcet methods

Posted Dec 19, 2018 18:47 UTC (Wed) by david.a.wheeler (subscriber, #72896)
Parent article: Python gets a new governance model

Technically there isn't one "Condorcet method". There are many different voting systems that meet the Condorcet criteria, and they are all Condorcet methods.

From Wikipedia's entry https://en.wikipedia.org/wiki/Condorcet_method :

"A Condorcet method (English: /kɒndɔːrˈseɪ/) is an election method that elects the candidate that would win a majority of the vote in all of the head-to-head elections against each of the other candidates, whenever there is such a candidate. A candidate with this property is called the Condorcet winner. Voting methods that always elect the Condorcet winner, when one exists, satisfy the Condorcet criterion."

There are many Condorcet methods

Posted Dec 19, 2018 19:27 UTC (Wed) by njs (subscriber, #40338) [Link]

Yes, this was discussed exhaustively in one of the threads linked above :-). The specific method we ended up with was a ranked choice vote, then if there's a Condorcet winner, they win, and otherwise (= tie or cycle) we revote. This is a pretty simple method, but AFAIK it doesn't have a standard name so we ended up calling it things like "pure Condorcet" to distinguish from e.g. the Schulze method that Debian uses.