4,193
edits
Total approval chain climbing: Difference between revisions
Correcting link to Forest Simmons' email and minor formatting
(Adding to Category:Aggregate methods and linking to completion method, even though this isn't a completion method by my definition.) |
(Correcting link to Forest Simmons' email and minor formatting) |
||
Line 1:
'''Total approval chain climbing''' ('''TACC''') is a Condorcet [[completion method]] using an [[Approval ballot|approval]] component, invented by [[Forest Simmons]]. In the three-candidate case it is equivalent to electing the candidate in the cycle who defeats the approval loser pairwise. The motivation is to reduce [[burial]] incentive.
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.
Thread here: http://lists.electorama.com/pipermail/election-methods-electorama.com/2014-April/
▲Example:
* 34: A>B|>C
| |||