Hallo,
suppose N is the number of candidates. Suppose d[i,j]
with i <> j is the number of voters who strictly prefer
candidate i to candidate j. Suppose d[i,j] : = 0 for i = j.
Suppose d[i] : = max { d[i,j] | j = 1,...,N }.
Then Minimax(pairwise opposition) chooses the candidate i
with minimal d[i].
Minimax(pairwise opposition) satisfies later-no-harm because
ranking an additional candidate can only increase but not
decrease d[k] for every not ranked candidate k. However,
my claim that Minimax(pairwise opposition) satisfies
later-no-help was incorrect.
Markus Schulze
----
Election-methods mailing list - see http://electorama.com/em for list info
