[EM] a solution to the by-election problem?

[Kristofer Munsterhjelm]

On 2026-04-20 23:39, Ross Hyman via Election-Methods wrote:
> Hi all,
> 
> The by-election problem is the following:
> Starting with a Droop compliant solution for the M-winner problem,
> exclude one of the M winners. Now determine a new set of M-winners
> that includes the M-1 remaining previous winners and is also Droop
> compliant. There is no STV method that does this. Either you preserve
> Droop compliance but not all the M-1 previous winners are reelected,
> or you protect the M-1 previous winners from exclusion and the new Mth
> winner is not guaranteed to be Droop compliant.

Don't combinatorial methods lke Schulze STV or CPO-STV do this?

Do the Condorcet election with every superset of the (M-1) winners that 
have already been elected. Pick the winner according to the pairwise method.

Or can they still work themself into a corner they can't get out of?

-km