Tideman alternative method

The Tideman Alternative method, also called Alternative-Smith voting, is a voting rule developed by Nicolaus Tideman which selects a single winner using ranked ballots. This method is Smith-efficient, making it a kind of Condorcet method, and uses the alternative vote (RCV) to resolve any cyclic ties.

Procedure

Tideman's Alternative Smith with three in the Smith set

The procedure for Tideman's rule is as follows:

Eliminate all candidates who are not in the top cycle (most often defined as the Smith set).
If there is more than one candidate remaining, eliminate the candidate ranked first by the fewest voters.
Repeat the procedure until there is a Condorcet winner, at which point the Condorcet winner is elected.

The procedure can also be applied using tournament sets other than the Smith set, e.g. the Landau set, Copeland set, bipartisan set, or the split-cycle set.

Features

Strategy-resistance

Alternative Smith strongly resists both strategic nomination and strategic voting by political parties or coalitions (although like every system, it can still be manipulated in some situations). The Smith and runoff components of the system each cover the other's weaknesses:

Smith-efficient methods are difficult for any coalition to manipulate, because no majority-strength coalition will have an incentive to remove a Condorcet winner: if most voters prefer A to B, A can already defeat B.
- This reasoning does not apply to situations with a Condorcet cycle, however.
- While Condorcet cycles are rare in practice with honest voters, burial (ranking a strong rival last, below weak opponents) can often be used to manufacture a false cycle.
Instant runoff voting is resistant to burial, because it is only based on each voter's top preference in any given round. This means that burial strategies effective against the Smith-elimination step are not effective against the instant runoff step.
- On the other hand, instant-runoff voting is highly vulnerable to a lesser evil (decapitation) strategy: defeating a greater evil requires voters to rank a strong candidate first, rather than support their sincere favorite.
- However, if such a candidate exists (with majority support), they will usually be a Condorcet winner, and elected in the first round.

The combination of these two methods creates a highly strategy-resistant system.

Spoiler effects

Alternative Smith fails independence of irrelevant alternatives, meaning it can sometimes be affected by spoiler candidates. However, the method adheres to a weaker property that eliminates most spoilers, sometimes called independence of Smith-dominated alternatives (ISDA). This method states that if one candidate (X) wins an election, and a new alternative (Y) is added, X will still win the election as long as Y is not in the highest-ranked cycle.

Comparison table

The following table compares Alternative Smith with other single-winner election methods:

Comparison of single-winner voting systems
Criterion Method	Majority	Majority loser	Mutual majority	Condorcet winner^{[Tn 1]}	Condorcet loser	Smith^{[Tn 1]}	Smith-IIA^{[Tn 1]}	IIA/LIIA^{[Tn 1]}	Cloneproof	Monotone	Participation	Later-no-harm^{[Tn 1]}	Later-no-help^{[Tn 1]}	No favorite betrayal^{[Tn 1]}	Ballot type
Anti-plurality	No	Yes	No	No	No	No	No	No	No	Yes	Yes	No	No	Yes	Single mark
Approval	Yes	No	No	No	No	No	No	Yes^{[Tn 2]}	Yes	Yes	Yes	No	Yes	Yes	Approvals
Baldwin	Yes	Yes	Yes	Yes	Yes	Yes	No	No	No	No	No	No	No	No	Ranking
Black	Yes	Yes	No	Yes	Yes	No	No	No	No	Yes	No	No	No	No	Ranking
Borda	No	Yes	No	No	Yes	No	No	No	No	Yes	Yes	No	Yes	No	Ranking
Bucklin	Yes	Yes	Yes	No	No	No	No	No	No	Yes	No	No	Yes	No	Ranking
Coombs	Yes	Yes	Yes	No	Yes	No	No	No	No	No	No	No	No	Yes	Ranking
Copeland	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	No	Yes	No	No	No	No	Ranking
Dodgson	Yes	No	No	Yes	No	No	No	No	No	No	No	No	No	No	Ranking
Highest median	Yes	Yes^{[Tn 3]}	No^{[Tn 4]}	No	No	No	No	Yes^{[Tn 2]}	Yes	Yes	No^{[Tn 5]}	No	Yes	Yes	Scores
Instant-runoff	Yes	Yes	Yes	No	Yes	No	No	No	Yes	No	No	Yes	Yes	No	Ranking
Kemeny–Young	Yes	Yes	Yes	Yes	Yes	Yes	Yes	LIIA Only	No	Yes	No	No	No	No	Ranking
Minimax	Yes	No	No	Yes^{[Tn 6]}	No	No	No	No	No	Yes	No	No^{[Tn 6]}	No	No	Ranking
Nanson	Yes	Yes	Yes	Yes	Yes	Yes	No	No	No	No	No	No	No	No	Ranking
Plurality	Yes	No	No	No	No	No	No	No	No	Yes	Yes	Yes	Yes	No	Single mark
Random ballot^{[Tn 7]}	No	No	No	No	No	No	No	Yes	Yes	Yes	Yes	Yes	Yes	Yes	Single mark
Ranked pairs	Yes	Yes	Yes	Yes	Yes	Yes	Yes	LIIA Only	Yes	Yes	No^{[Tn 5]}	No	No	No	Ranking
Runoff	Yes	Yes	No	No	Yes	No	No	No	No	No	No	Yes	Yes	No	Single mark
Schulze	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	Yes	Yes	No^{[Tn 5]}	No	No	No	Ranking
Score	No	No	No	No	No	No	No	Yes^{[Tn 2]}	Yes	Yes	Yes	No	Yes	Yes	Scores
Sortition^{[Tn 8]}	No	No	No	No	No	No	No	Yes	No	Yes	Yes	Yes	Yes	Yes	None
STAR	No	Yes	No	No	Yes	No	No	No	No	Yes	No	No	No	No	Scores
Tideman alternative	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	Yes	No	No	No	No	No	Ranking
Table Notes	^ ^a ^b ^c ^d ^e ^f ^g Condorcet's criterion is incompatible with the consistency, participation, later-no-harm, later-no-help, and sincere favorite criteria. ^ ^a ^b ^c Approval voting, score voting, and majority judgment satisfy IIA if it is assumed that voters rate candidates independently using their own absolute scale. For this to hold, in some elections, some voters must use less than their full voting power despite having meaningful preferences among viable candidates. ^ Majority Judgment may elect a candidate uniquely least-preferred by over half of voters, but it never elects the candidate uniquely bottom-rated by over half of voters. ^ Majority Judgment fails the mutual majority criterion, but satisfies the criterion if the majority ranks the mutually favored set above a given absolute grade and all others below that grade. ^ ^a ^b ^c In Highest median, Ranked Pairs, and Schulze voting, there is always a regret-free, semi-honest ballot for any voter, holding all other ballots constant and assuming they know enough about how others will vote. Under such circumstances, there is always at least one way for a voter to participate without grading any less-preferred candidate above any more-preferred one. ^ ^a ^b A variant of Minimax that counts only pairwise opposition, not opposition minus support, fails the Condorcet criterion and meets later-no-harm. ^ A randomly chosen ballot determines winner. This and closely related methods are of mathematical interest and included here to demonstrate that even unreasonable methods can pass voting method criteria. ^ Where a winner is randomly chosen from the candidates, sortition is included to demonstrate that even non-voting methods can pass some criteria.

References

Green-Armytage, James. Four Condorcet-Hare Hybrid Methods for Single-Winner Elections.

[condorcet-iia-incompatibility-1] ^ ^a ^b ^c ^d ^e ^f ^g Condorcet's criterion is incompatible with the consistency, participation, later-no-harm, later-no-help, and sincere favorite criteria.

[IIA_rating_methods-2] Approval voting, score voting, and majority judgment satisfy IIA if it is assumed that voters rate candidates independently using their own absolute scale. For this to hold, in some elections, some voters must use less than their full voting power despite having meaningful preferences among viable candidates.

[3] Majority Judgment may elect a candidate uniquely least-preferred by over half of voters, but it never elects the candidate uniquely bottom-rated by over half of voters.

[mjmmc-4] Majority Judgment fails the mutual majority criterion, but satisfies the criterion if the majority ranks the mutually favored set above a given absolute grade and all others below that grade.

[semipc-5] In Highest median, Ranked Pairs, and Schulze voting, there is always a regret-free, semi-honest ballot for any voter, holding all other ballots constant and assuming they know enough about how others will vote. Under such circumstances, there is always at least one way for a voter to participate without grading any less-preferred candidate above any more-preferred one.

[MinimaxVarient-6] A variant of Minimax that counts only pairwise opposition, not opposition minus support, fails the Condorcet criterion and meets later-no-harm.

[7] A randomly chosen ballot determines winner. This and closely related methods are of mathematical interest and included here to demonstrate that even unreasonable methods can pass voting method criteria.

[8] Where a winner is randomly chosen from the candidates, sortition is included to demonstrate that even non-voting methods can pass some criteria.

[Tn 1]

[Tn 2]

[Tn 3]

[Tn 4]

[Tn 5]

[Tn 6]

[Tn 7]

[Tn 8]