On Thu, Nov 13, 2008 at 5:34 AM, Brian Olson <[EMAIL PROTECTED]> wrote:
> I actually already have a mode in my program to run multiple elections at
> each point and average the color of the winners over those rounds.
However, that randomness is due to the random distribution of the voters.
With a
I actually already have a mode in my program to run multiple elections
at each point and average the color of the winners over those rounds.
It doesn't hurt anything to have more than three candidates as long as
each one gets a color reasonably distinctive from the others. As long
as each c
It would also be possible to support more than 3 if you are willing to
accept some ambiguous pixels.
You could give each candidate a colour and then blend the colours in
proportion to the probability.
For a method which has reasonably sharp edges to the win regions, this
could be reasonably effec
It recently occurred to me that in the case of three-candidate elections,
Yee-Bolson Diagrams can be
generalized to lotteries:
In the three candidate case the traditional Yee-Bolson Diagram of a method is a
coloring of voter/candidate
space in which each point of the space is assigned the colo
