One family of Condorcet methods consists of systems that first conduct a series of pairwise comparisons and then, if there is no Condorcet winner, fall back to an entirely different, non-Condorcet method to determine a winner. The simplest such fall-back methods involve entirely disregarding the results of the pairwise comparisons. For example, the Black method chooses the Condorcet winner if it exists, but uses the Borda count instead if there is a cycle (the method is named for Duncan Black).
One family of Condorcet methods consists of systems that first conduct a series of pairwise comparisons and then, if there is no Condorcet winner, fall back to an entirely different non-Condorcet method to determine a winner. The simplest such fall-back methods involve entirely disregarding the results of the pairwise comparisons For example, the Black method chooses the Condorcet winner if it exists but uses the Borda count instead if there is a cycle (the method is named for Duncan Black).