Total approval chain climbing: Difference between revisions
Replaced reference and attribution with reference to earlier EM post.
(Adding to Category:Aggregate methods and linking to completion method, even though this isn't a completion method by my definition.) |
(Replaced reference and attribution with reference to earlier EM post.) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 1:
'''Total approval chain climbing''' ('''TACC''') is a Condorcet [[completion method]] using an [[Approval ballot|approval]] component, invented by
It works as follows:<blockquote>1. Sort the candidates by increasing total approval.
Line 5:
2. Starting with an empty "chain of candidates", consider each candidate in the above order. When the candidate defeats all candidates already in the chain, add her at the top of the chain. The last added candidate wins.</blockquote>Note that because of [[Condorcet cycle|Condorcet cycles]], it isn't always possible for one candidate to beat all others. Because of this, the procedure may stop before all candidates can be added to the chain.
▲Example:
* 34: A>B|>C
Line 22 ⟶ 18:
TACC is [[Smith-efficient]] because all members of the Smith set pairwise beat all candidates not in the Smith set, therefore once a Smith set member is added to the chain, a non-Smith set member can't be added to the chain, because they can't beat the Smith set member, and thus, can't beat everyone in the chain. Since this implies a Smith set member must be the last added candidate, only members of the Smith set can win.
== Variants ==
* TSCC: see [[User:MellowMoon/Total Score chain climbing]]▼
▲Total Score chain climbing
== References ==
<references/>
[[Category:Smith-efficient Condorcet methods]]
[[Category:Condorcet-cardinal hybrid methods]]
|