[EM] Ranked Pairs Feint to Max Gradient Chain Building

Kristofer Munsterhjelm km_elmet at t-online.de
Tue Jan 31 04:16:50 PST 2023

On 1/26/23 21:53, Forest Simmons wrote:

> [Again, we used the fact that all candidates are uncovered ... which 
> makes the initial chain head the winner. This helps explain Krisyofer's 
> original observation that got this whole thing started. So you can see 
> why I'm tempted to call this the KKF method!]
> What do you think?

Sounds good! But I'm increasingly feeling that it's hard to understand 
the tradeoffs of a method without having a view to their behavior, like 
simulations. So if it turns out to be awful in practice, then perhaps 
I'll have to retract my statement :-)

On a broader level, I'm wondering if we should pool our simulators 
somehow to not duplciate the effort it takes to implement methods. But 
my own main simulator is not the prettiest of code, so I would have to 
clean that up first. And then I don't get much further than that!


More information about the Election-Methods mailing list