On Wed, Jul 6, 2011 at 6:06 PM, <fsimm...@pcc.edu> wrote: > > Of course, with too many factions, the optimal strategy computation would > be intractable. >
With twenty candidates, there are about a million different possible subsets to consider. Seems like it could be tractable. I'm not exactly following how the tree is organized. If there are N candidates and every voter ranks all candidates, then the biggest N-1 size faction will be the one that omits the candidate who is ranked last by the most voters, right? Can't you apply that recursively to build the tree?
---- Election-Methods mailing list - see http://electorama.com/em for list info
