Baldwin's method: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 3:
Note that Baldwin's method is [[Smith-efficient]]; this is because [[Borda]] can [[Weighted positional method#Criterion compliances|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|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.
Example:
[[Category:Condorcet methods]]▼
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.
▲[[Category:Smith-efficient Condorcet methods]]
[[Category:Sequential loser-elimination methods]]
| |||