Dear Alex, methods that always choose one of the candidates with the largest number of pairwise victories are called "Copeland methods". The main problem of Copeland methods is that they are manipulable by clones in a very straight forward manner.
Markus Schulze
