[EM] Clone proofing Copeland

[Markus Schulze]

Dear Forest Simmons,

you wrote (30 Dec 2006):

> Here's a version that is both clone proof and monotonic:
>
> The winner is the alternative A with the smallest number
> of ballots on which alternatives that beat A pairwise are
> ranked in first place. [shared first place slots are counted
> fractionally]

I would say that this method is vulnerable to crowding. Please
demonstrate that this method is cloneproof.

Markus Schulze