Dear participants, Mike Ossipoff wrote (16 Jan 2003): > But in all Condorcet versions, a candidate wins if > he has no pairwise decisions for or against him.
Of course, that's not true. Example: A = B A = C A = D A = E A = F B > C B > D B > E B < F C > D C < E C > F D > E D > F E > F Candidate A has no pairwise decisions for or against him. However, e.g. Copeland chooses candidate B decisively. Markus Schulze ---- For more information about this list (subscribe, unsubscribe, FAQ, etc), please see http://www.eskimo.com/~robla/em
