[EM] ranked pair method that resolves beath path ties.

[Markus Schulze]

Dear Ross Hyman,

you wrote (28 Nov 2011):

 > One way of retaining monotonicity, I think, is to replace
 > the Sets with objects that record the number of times that
 > a A has beaten B.

Suppose A-C-B is the strongest path from candidate A to
candidate B. Suppose B-A is the strongest path from candidate B
to candidate A.

Suppose candidate C is replaced by clones C(1),...,C(n). Then
the number of times A beats B is multiplied.

Markus Schulze