On Oct 15, 2006, at 4:13 , <[EMAIL PROTECTED]> <[EMAIL PROTECTED]>
wrote:
> I think I've answered my own question. I did some more searching, and
> found Warren D. Smith's "Descriptions of single-winner voting
> systems" at
> http://math.temple.edu/~wds/homepage/votedesc.pdf . Now I just need
I doubt anyone has what could be described as a comprehensive list of methods.
Your words about 99th and 100th makes me wonder about your understanding.
You should pretty much start with an array, one line and one column for
each candidate. You must provide for expanding the array if write-in
I think I've answered my own question. I did some more searching, and
found Warren D. Smith's "Descriptions of single-winner voting systems" at
http://math.temple.edu/~wds/homepage/votedesc.pdf . Now I just need to see
if there is something similar to what I was playing with.
If anyone has other c
I was just wondering if anyone had a link to a comprehensive list of
Condorcet methods. I've been toying with one where you start flipping the
lowest-ranked choices (under the theory that a person cares less about
switching 99th and 100th place than they do switching 1st and 2nd), but I
realize tha
