Information for "Total approval chain climbing"

Basic information

Display titleTotal approval chain climbing
Default sort keyTotal approval chain climbing
Page length (in bytes)2,353
Namespace ID0
Page ID442
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>KVenzke
Date of page creation16:27, 21 February 2012
Latest editorKristomun (talk | contribs)
Date of latest edit23:48, 7 August 2023
Total number of edits17
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (10)

Templates used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Total approval chain climbing (TACC) is a Condorcet completion method using an approval component, invented by Jobst Heitzig in 2005.[1] 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.
Information from Extension:WikiSEO