[EM] Best Landau Method?

[Kristofer Munsterhjelm]

On 7/21/21 6:59 AM, Susan Simmons wrote:
> For first approximation simplicity we temporarily ignore the possibity 
> of pairwise ties in the following paragraphs ..
> 
> A candidate is in the Smith set if any other candidate can be reached 
> from it by a beat path.
> 
> Similarly, a candidate is in the Landau set if any other candidate can 
> be reached from it by a short beat path, meaning in only one or two 
> steps. In that case it is said to be uncovered because no other 
> candidate beats both it and every candidate that it beats.
> 
> Copeland is a well known monotonic method that always elects from 
> Landau, for example.
> 
> Can you think of a Landau method that is both monotone and clone free? 
> If so, you have excellent talent for this kind of work. Perhaps you 
> could figure out a way to de-clone Copeland without messing up 
> monotonicity.

Short ranked pairs? :-) Now if we could just construct an algorithm for 
it...

Any de-cloned Copeland would have to sometimes elect outside the 
Copeland set, of course.

-km