[EM] Mono-add-top method suggestion

[Kevin Venzke]

Hello,

Kristofer Munsterhjelm via Election-Methods <election-methods at lists.electorama.com> a écrit :
> On 2025-08-10 07:44, Chris Benham via Election-Methods wrote:
> > This is my (not too fanciful thought experiment) idea for a method that
> > meets Mono-add-Top and is more Condorcet efficient than Hare (but more
> > complicated) using ranked ballots with explicit approval cutoffs ...
> 
> This is a generally interesting idea: suppose properties X and Y are
> incompatible. How close to Y can we get while retaining X?
> 
> But it's also, generally, a very hard question to answer. The closest I
> can think of something that tries to do that is River's ISDA (as an
> approximation to independence of covered alternatives without losing
> monotonicity), and I don't think River was deliberately designed to pass it.

I don't think it's so uncommon to *try* to do this, for example:

ICA: satisfy weak FBC and preserve as much Condorcet as possible
ACP: satisfy Later-no-harm (and -help!) and preserve as much Condorcet as possible
CDTT,___: satisfy minimal defense and preserve as much Later-no-harm as possible

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.

Kevin
votingmethods.net