3 ms·
Barring edge cases, Condorcet methods can be described like single-elimination tournaments which pretty much everyone is familiar with. Yes, graph theory comes
by bradbeattie 10y ago
Barring edge cases, Condorcet methods can be described like single-elimination tournaments which pretty much everyone is familiar with.
Yes, graph theory comes into play for tie breaking (assuming we can agree that cyclic Condorcet paradoxes are ties of sorts), but the core of the idea is already understood by an overwhelming majority in concept if not by name.
- dragonwriter 10y agoCondorcet methods are more like a particular method of choosing the winner of a round-robin tournament; they don't really map naturally to a single-elimination tournament. Of course, if you assume consistent relative performance, then any single winner tournament that you construct among the candidates in a Condorcet election would choose the Condorcet winner of one exists, and some member of the Smith set in any case (though different initial bracket structure can choose different Smith set members in the absence of a Condorcet winner.)