On Mon, Aug 31, 2009 at 7:07 AM, Kristofer Munsterhjelm<[email protected]> wrote: > Could your third point be done, for very small electorates, by use of > minimax game tree algorithms like the one used in computer chess? The > objective for each voter would be to get his own candidate to win (and for > rated methods, to have the winner maximize his individual utility). Minimax > requires perfect information, so that's a flaw, but it should give a bound, > as it were, because the voters can't know more than perfect information, > only less.
What you could do is take a "poll" and have 10 random voters. You then work out optimal assuming that they are the electorate. The actual election would then be slightly different as you include all of the voters. However, can minimax be applied in a single step "game"? ---- Election-Methods mailing list - see http://electorama.com/em for list info
