4,193
edits
Total approval chain climbing: Difference between revisions
Adding to Category:Aggregate methods and linking to completion method, even though this isn't a completion method by my definition.
m (Cleanup formatting) |
(Adding to Category:Aggregate methods and linking to completion method, even though this isn't a completion method by my definition.) |
||
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 47:
[[Category:Smith-efficient Condorcet methods]]
[[Category:Condorcet-cardinal hybrid methods]]
[[Category:Aggregate methods]]
| |||