Baldwin's method: Difference between revisions
no edit summary
Psephomancy (talk | contribs) (add category) |
No edit summary |
||
Line 1:
See [[w:Nanson's_method#Baldwin_method|Baldwin's method on Wikipedia]]
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.
[[Category:Condorcet methods]]
| |||