On Tue, 26 Feb 2002, Forest Simmons wrote in part:
The method is not summable in polynomial size data structures, but an
approximation can be done in O(K^3) where K is the number of candidates
Here's the O(K^3) approximation I have in mind:
The input is any (multi)set of CR ballots of any
The goal of maximizing voting power while minimizing manipulability seems
to be an elusive will 'O wisp.
However, in committees and other small groups one option is repeated
balloting. For example, approval ballots can be repeated N times or until
the ballots stabilize, whichever comes first.
