Minimax Condorcet

In voting systems, 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 also known 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.

Minimax selects the candidate for whom the greatest pairwise score for another candidate against him is the least such score among all candidates.

Formally, let ${\displaystyle score(X,Y)}$ denote the pairwise score for ${\displaystyle X}$ against ${\displaystyle Y}$. Then the candidate, ${\displaystyle W}$ selected by minimax (aka the winner) is given by:

...
Wikipedia