Total approval chain climbing: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 3:
It works as follows:<blockquote>1. Sort the candidates by increasing total approval.
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>
Thread here: http://lists.electorama.com/pipermail/election-methods-electorama.com/2014-April/097912.html
(Full definition should be added)
== Notes ==
TACC and its variants are notable for always electing from the [[Banks set]], a subset of the [[Uncovered set|uncovered set]] and thus the [[Smith set]]..
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.
{{stub}}
| |||