Black's method: Difference between revisions
Content added Content deleted
Psephomancy (talk | contribs) (Created page with "'''Black's method''' chooses the Condorcet winner if it exists, but uses the Borda count instead if there is an ambiguity (the method is named for w:Duncan Black)...") |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Black's method''' chooses the [[Condorcet winner]] if it exists, but uses the [[Borda count]] instead if there is an ambiguity (the method is named for [[w:Duncan Black|Duncan Black]]). |
'''Black's method''' chooses the [[Condorcet winner]] if it exists, but uses the [[Borda count]] instead if there is an ambiguity (the method is named for [[w:Duncan Black|Duncan Black]]). |
||
Example: |
|||
25 A>B>C |
|||
40 B>C>A |
|||
35 C>A>B |
|||
Borda scores are A 185, B 205, C 210. A pairwise beats B beats C beats A, so there is no Condorcet winner (because everyone has at least one defeat). So the Borda winner, C, wins. |
|||
Note that a [[Smith-efficient]] variant of Black's method could be used instead, to ensure someone in the [[Smith set]] will win. |
|||
[[Category:Condorcet methods]] |
[[Category:Condorcet methods]] |
||
Revision as of 15:45, 26 March 2020
Black's method chooses the Condorcet winner if it exists, but uses the Borda count instead if there is an ambiguity (the method is named for Duncan Black).
Example:
25 A>B>C 40 B>C>A 35 C>A>B
Borda scores are A 185, B 205, C 210. A pairwise beats B beats C beats A, so there is no Condorcet winner (because everyone has at least one defeat). So the Borda winner, C, wins.
Note that a Smith-efficient variant of Black's method could be used instead, to ensure someone in the Smith set will win.