Defeat-dropping Condorcet methods

These are Condorcet methods which, in the event of a cycle, rank all candidates' pairwise defeats in some order, and then ignore as few of the first pairwise defeats in the order as necessary to find a candidate who is a Condorcet winner based on their non-ignored pairwise matchups. They can all be considered generalizations of Minimax to situations where there are more than 3 candidates in the Smith set.