[Elections] A simple SqF board elections solution using SqP
Daniel Vainsencher
danielv at techunix.technion.ac.il
Sun Jan 15 21:46:45 CET 2006
From what I've seen, Condorcet (possibly with one of the extra rules
such as Schultze) is the most convincing tallying algorithm, so I don't
think there's a reason to change the specs. If you're proposing to
implement the system, and Condorcet seems to complex at the moment,
implement any other tallying algorithm for a start, that uses the same
vote format (the voter provides a preference order on the alternatives)
and we can replace it in the next iteration, possibly by running one of
the free software implementations via OSProcess, or whatever.
Peter is willing to help, but my understanding is he can't commit the
time to lead the implementation effort. Cees, can you explain exactly
what relevant code you have available, and what part you want to take in
the implementation?
Daniel
Cees De Groot wrote:
> On 1/9/06, Peter Crowther <Peter at ozzard.org> wrote:
>
>>I'd much *prefer* to use our own versions of these tools; I think we're
>>going to be up against it to get them stable in the time we have
>>available.
>>
>
> Well, the alternative solution is of course to use a simpler voting
> scheme than Condorcet, which is probably one of the most complex you
> can have (ok, there's STV as well).
>
> Is there so much wrong with just giving everyone 0...7 votes and
> making a tally? That'd be trivial to do in our own tools...
>
> (one big reason Condorcet hasn't been adopted, I think, is that it is
> so damn hard to explain what happens :-))
> _______________________________________________
> Elections mailing list
> Elections at lists.squeakfoundation.org
> http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/elections
>
More information about the Elections
mailing list