On 8/22/08, Michael Allan <[EMAIL PROTECTED]> wrote: > The general structure of a delegate cascade is actually a cyclic > graph. But cycles can occur only at the bottom of each casacade, > where they result in pools. Pools are equivalent to roots, so d'Hondt > (etc.) should still work.
Maybe a rule like 1) Find the candidate with the highest score that is part of a loop. 2) If there is a tie exclude from consideration any candidate who votes for a candidate who is also part of the tie. 3) Of the ones remaining, pick one somehow (random?) 4) Designate that candidate as abstaining 5) If there are loops remaining goto 1) This will create a tree structure. ---- Election-Methods mailing list - see http://electorama.com/em for list info
