Total approval chain climbing: Difference between revisions

no edit summary
No edit summary
Line 8:
 
(Full definition should be added)
 
Example:
 
34 A>B|>C
35 B|>C>A
31 C>A|>B
 
Approvals (using the [[approval threshold]] symbol "|") are A 65, B 69, C 31. C is added first into the chain because C has the lowest approval, and then B, not A, is added into the chain, because B is the only candidate who [[pairwise beat|pairwise beats]] C. A can't then be added in, because A can only beat B and not also C. Therefore, B is the winner.
 
== Notes ==
Line 16 ⟶ 24:
{{stub}}
 
[[Category:SingleSmith-winnerefficient votingCondorcet methods]]
[[Category:Condorcet-cardinal hybrid methods]]