[EM] How to break this tie?

[Markus Schulze]

Dear Chris,

here is an example to illustrate my reservations
about the uncovered set.

Suppose the defeats are (sorted according to their
strengths in a decreasing order):

  D > A
  A > B
  B > C
  C > A
  C > D
  B > D

The uncovered set is {A,B,C}. When the MinMax method
(or any other method that is identical to the MinMax
method in the 3-candidate case) is applied to the
uncovered set, then candidate A is the winner.

Now suppose some voters rank candidate A higher
(without changing the order in which they rank the
other candidates relatively to each other), so that
the defeats are (sorted according to their strengths
in a decreasing order):

  A > C
  D > A
  A > B
  B > C
  C > D
  B > D

Now the uncovered set is {A,B,D}. When the MinMax
method is applied to the uncovered set, then
candidate D is the winner. Thus by ranking candidate A
higher, candidate A is changed from a winner to a loser.

Markus Schulze