[EM] More surprising summability results

[Kristofer Munsterhjelm]

On 2024-01-26 14:19, Kristofer Munsterhjelm wrote:

> But then I thought a bit about it and I realized there does exist an 
> O(n) summary that can be used to create a method that passes the 
> Condorcet criterion... *as long as you give up neutrality*.
> 
> It's so obvious in retrospect, but it was very surprising to me before 
> the fact. Can you see how it would be done?

Whoops, I have to retract this. The results didn't show what I thought 
they'd show, and thus I can't prove O(n) Condorcet -- only O(n) 
Condorcet loser (which is easy).

(I then proceeded to trick myself into thinking it was obvious :-)

-km