[EM] SODA

[Andy Jennings]

On Wed, Jul 6, 2011 at 6:06 PM, <fsimmons at 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?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20110707/91057944/attachment-0004.htm>