[EM] Comparing CW with "write-in pairwise" CW

[Kevin Venzke]

Hi Kristofer,



----- Mail original -----
>De : Kristofer Munsterhjelm <km_elmet at t-online.de>
>
>It's still an open question whether or not you can make a method that 
>passes both Smith and mono-add-top. I lean towards yes; if I remember 
>correctly, Kevin leans towards no.
>

That's my feeling when thinking over the issue. I would be very interested in the opposite being true.

MinMax(margins) satisfies MATop, I would say, because the evaluation of the candidates is independent of any path tracing. As you add ballots with X on top, the significance of his contests doesn't change, and we aren't looking at anybody else's wins or losses. That seems inherently very different from Smith.

In MinMax you can confidently say which candidate will become CW first if you keep adding the ballots. But with Smith you need to be concerned that this candidate will lose his path into the Smith set before that happens. Might there be such a thing as a candidate who is "most securely in the Smith set"? I think this may be a prerequisite.

Kevin