Baldwin's method

From Electowiki
Jump to navigation Jump to search

See Baldwin's method on Wikipedia

Note that Baldwin's method is Smith-efficient; this is because Borda can never rank a Condorcet winner last, and a Condorcet winner will always stay a Condorcet winner when losing candidates are removed/eliminated from an election. When all but one member of the Smith set is eliminated, the remaining member of the Smith set will pairwise beat all other candidates by definition, and thus will "become" a Condorcet winner at that point that can no longer be eliminated, and thus is guaranteed to be the final remaining candidate and win.


25 A>B>C 40 B>C>A 35 C>A>B

Borda scores are A 185, B 205, C 210. A beats B beats C beats A, so there is no Condorcet winner, and so A, the Borda loser, is eliminated. Since B beats C, B wins. Note that this is a different result than Black's method, which would elect C.