[EM] Mono-add-top method suggestion

[Kristofer Munsterhjelm]

On 2025-08-13 15:32, Kevin Venzke wrote:

> In a DNA context I can search for methods that only have X failures of some type,
> or match another method with only X number of deviations, but the resulting
> methods can hardly ever be explained in plain English. Optimistically they could
> be used to rule out certain outcomes being possible in certain scenarios, or
> suggest broadly what the method would have to be like.

I've done similar things with mixed integer programming to find 
minimally manipulable methods with few voters and candidates. It's not 
at all scalable and it's very hard to understand just what's going on, 
because all it outputs is an assignment like "for this particular 
election, elect A; for that particular election, elect B".

In principle similar methods could be used to find compatible criteria 
(again with few voters and candidates) - a SAT solver should work. But 
generalizing is indeed hard.

-km