We calculate the for the winner of that pair.
For each ( (winner, loser) ) in the sorted list (from largest to smallest margin): tideman algorithm
The Tideman algorithm is a masterpiece of social choice theory: it respects the will of the majority (Condorcet criterion), breaks cycles using a transparent landslide-first principle, and satisfies a host of desirable mathematical properties. It's used in real-world elections (e.g., some Linux kernel decisions, various private organizations) and forms the basis of modern voting system research. We calculate the for the winner of that pair
The Tideman algorithm (Ranked Pairs), invented by Nicolaus Tideman in 1987, answers this by saying: Lock in the strongest landslides first, skip any result that would create a cycle. some Linux kernel decisions