On Sun, 10 Jul 2005, Dave Ketchum wrote:
Pretty rare, but confusion made it happen near here last year:
Came deadline for petitions, and there were none, for the candidates had been
given a wrong date.
So EVERY voter had to writein to vote for their choice for that office.
There was a rece
Pretty rare, but confusion made it happen near here last year:
Came deadline for petitions, and there were none, for the candidates had
been given a wrong date.
So EVERY voter had to writein to vote for their choice for that office.
--
[EMAIL PROTECTED]people.clarityconnect.com/webpages3/
On Sun, 10 Jul 2005, Dave Ketchum wrote:
I believe I have the answer for Condorcet, and that you should be able to
build on this for ratings. I also think of voting at multiple precincts,
doing an array at each precinct, and summing the arrays for total district.
May have to scan each ballot
I believe I have the answer for Condorcet, and that you should be able to
build on this for ratings. I also think of voting at multiple precincts,
doing an array at each precinct, and summing the arrays for total district.
May have to scan each ballot for new names at start of its processing,
How do you compare a new entry all the ones that came before? Having a
policy for incomplete ballots isn't good enough because it doesn't compare
a new name to the other names on ballots before the first ballot to
include a new write-in candidate. So, there must always be a first pass
through a
Jobst,
I'm still digesting this. I'm always interested in potentially good "lottery
methods."
Here's my latest attempt:
Voters first submit approvals, and the candidates are listed in order of
approval.
Each voter then submits a number between 1 and the number of candidates (to be
used
Dear folks!
Some time ago I reported here upon the "Condorcet Lottery", a method
which determines the winner by drawing from a special probability
distribution (=lottery) among a special subset of the candidates (the
so-called Bipartisan set). The special property of that method was that
for every
