Minimax Condorcet method

In voting systems, the Minimax Condorcet method (often referred to as "the Minimax method") is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method, and the successive reversal method.

Minimax selects as the winner the candidate whose greatest pairwise defeat is smaller than the greatest pairwise defeat of any other candidate: or, put another way, "the only candidate whose support never drops below percent" in any pairwise contest.

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.

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 to not rank all the 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.
#*$\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 using margins.
#*$\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 sometimes called pairwise opposition.
#*$\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 cannot satisfy the independence of clones criterion because clones will have narrow win margins between them; this implies Minimax cannot satisfy local independence of irrelevant alternatives because three clones may form a cycle of narrow defeats as the first-, second-, and third-place winners, and removing the second-place winner may cause the third-place winner to be elected.

When the ''pairwise opposition'' variant is used, minimax also does not satisfy the Condorcet criterion. However, when equal-ranking is permitted, there is never an incentive to put one's first-choice candidate below another one on one's ranking. It also satisfies the later-no-harm criterion, which means that by listing additional, lower preferences in one's ranking, one cannot cause a preferred candidate to lose.

When constrained to the Smith set, as Smith/Minimax, minimax satisfies the Smith criterion and, by implication, the mutual majority, independence of Smith-dominated alternatives, and Condorcet loser criterion.

Markus Schulze modified minimax to satisfy several of the criteria above. Compared to Smith/Minimax, Nicolaus Tideman's ranked pairs method additionally satisfies clone independence and local independence of irrelevant alternatives.

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 alternatives winning votes and margins, 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
*Wald's maximin model – Wald's maximin model
*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