Minimax Condorcet

In voting systems, the Minimax Condorcet method is a single-winner ranked-choice voting method that always elects the majority (Condorcet) winner. Minimax compares all candidates against each other in a round-robin tournament, then ranks candidates by their worst election result (the result where they would receive the fewest votes). The candidate with the ''largest'' (maximum) number of votes in their ''worst'' (minimum) matchup is declared the winner.

Description of the method

The Minimax Condorcet method selects the candidate for whom the greatest pairwise score for another candidate against him or her is the least such score among all candidates.

Football analogy

Imagine politicians compete like football teams in a round-robin tournament, where every team plays against every other team once. In each matchup, a candidate's score is equal to the number of voters who support them over their opponent.

Minimax finds each team's (or candidate's) worst game – the one where they received the smallest number of points (votes). Each team's tournament score is equal to the number of points they got in their worst game. The first place in the tournament goes to the team with the best tournament score.

Formal definition

Formally, let $\operatorname(X,Y)$ denote the pairwise score for $X$ against $Y$. Then the candidate, $W$ selected by minimax (aka the winner) is given by:
: $W = \arg \min_X \left( \max_Y \operatorname(Y, X)\right)$

Variants of the pairwise score

When it is permitted to rank candidates equally, or not rank all candidates, three interpretations of the rule are possible. When voters must rank all the candidates, all three variants are equivalent.

Let $d(X, Y)$ be the number of voters ranking ''X'' over ''Y''. The variants define the score $\operatorname(X, Y)$ for candidate ''X'' against ''Y'' as:
#The number of voters ranking ''X'' above ''Y'', but only when this score exceeds the number of voters ranking ''Y'' above ''X''. If not, then the score for ''X'' against ''Y'' is zero. This variant is sometimes called ''winning votes'' is the most commonly used and preferred by social choice theorists.
#*$\operatorname(X,Y) := \begin d(X, Y), & d(X, Y) > d(Y, X) \\ 0, & \text \end$
#The number of voters ranking ''X'' above ''Y'' minus the number of voters ranking ''Y'' above ''X''. This variant is called ''margins'', and is less used.
#*$\operatorname(X,Y) := d(X, Y) - d(Y, X)$
#The number of voters ranking ''X'' above ''Y'', regardless of whether more voters rank ''X'' above ''Y'' or vice versa. This variant is called ''pairwise opposition'', and is also rarely used.
#*$\operatorname(X,Y) := d(X, Y)$

When one of the first two variants is used, the method can be restated as: "Disregard the weakest pairwise defeat until one candidate is unbeaten." An "unbeaten" candidate possesses a maximum score against him which is zero or negative.

Satisfied and failed criteria

Minimax using ''winning votes'' or ''margins'' satisfies the Condorcet and the majority criterion, but not the Smith criterion, mutual majority criterion, or Condorcet loser criterion. When ''winning votes'' is used, minimax also satisfies the plurality criterion.

Minimax fails independence of irrelevant alternatives, independence of clones, local independence of irrelevant alternatives, and independence of Smith-dominated alternatives.

With the ''pairwise opposition'' variant (sometimes called MMPO), minimax only satisfies the majority-strength Condorcet criterion; a candidate with a relative majority over every other may not be elected. MMPO is a later-no-harm system and also satisfies sincere favorite criterion.

Nicolaus Tideman modified minimax to only drop edges that create Condorcet cycles, allowing his method to satisfy many of the above properties. Schulze's method similarly reduces to minimax when there are only three candidates.

Examples

Example with Condorcet winner

The results of the pairwise scores would be tabulated as follows:

* indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
* indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: In all three alternatives Nashville has the lowest value and is elected winner.

Example with Condorcet winner that is not elected winner (for pairwise opposition)

Assume three candidates A, B and C and voters with the following preferences:

The results would be tabulated as follows:

* indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
* indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: With the winning votes and margins alternatives, the Condorcet winner A is declared Minimax winner. However, using the pairwise opposition alternative, C is declared winner, since less voters strongly oppose him in his worst pairwise score against A than A is opposed by in his worst pairwise score against B.

Example without Condorcet winner

Assume four candidates A, B, C and D. Voters are allowed to not consider some candidates (denoting an n/a in the table), so that their ballots are not taken into account for pairwise scores of that candidates.

The results would be tabulated as follows:

* indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
* indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result:
Each of the three alternatives gives another winner:
* the winning votes alternative chooses A as winner, since it has the lowest value of 35 votes for the winner in his biggest defeat;
* the margin alternative chooses B as winner, since it has the lowest difference of votes in his biggest defeat;
* and pairwise opposition chooses the Condorcet loser D as winner, since it has the lowest votes of the biggest opponent in all pairwise scores.

See also

* Minimax – main minimax article
* Multiwinner voting – contains information on some multiwinner variants of Minimax Condorcet.

References

*Levin, Jonathan, and Barry Nalebuff. 1995. "An Introduction to Vote-Counting Schemes." Journal of Economic Perspectives, 9(1): 3–26.

External links

Description of ranked ballot voting methods: Simpson
by Rob LeGrand
Condorcet Class
PHP library supporting multiple Condorcet methods, including the three variants of Minimax method.
Electowiki: minmax

{{voting systems

Monotonic Condorcet methods