[EM] A sorta IFPP-like method

[Kristofer Munsterhjelm]

On 7/12/23 01:24, Kristofer Munsterhjelm wrote:
> Here's an idea of a possible method inspired by my MCAB and IFPP:
> 
> Say that a set of candidates is eliminable if their combined first 
> preference count is less than or equal to a third of the total number of 
> voters, but adding any candidate would make the total exceed 1/3.
> 
> For one candidate: A's score is the number of voters.
> For two candidates: A's score is A>B.
> For three or more: A's score is the maximum score obtained by choosing 
> some eliminable set, eliminating it, and recursing. The set is chosen so 
> as to maximize A's score.

Oh, I forgot to say: if there doesn't exist any eliminable sets without 
A in it, then A's score is 0. For instance, if A is ranked last by 
everybody, no matter who's left in the running, every eliminable set 
will contain A.

-km