Minimax Condorcet method

  • 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.

  • description of the method
  • satisfied and failed criteria
  • examples
  • see also
  • references
  • external links

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.