[EM] Fast algorithms for Yee/Bolson pictures

Concerning those pictures by Ka-Ping Yee and Brian Olson. The naive method of producing these pictures, assuming an NxN pixel picture and V voters per election, takes time of order (N*N*V). I just want to point out for algorithms fans, that it is possible to accomplish essentially the same

Re: [EM] lots of code/logs wrt simulation code

No effect. I have probably set up something wrong with my gcc. Anyway, these are the logs: First make: bash-3.2$ make spacegraph g++ -Wall -O2 -DUSE_OLD_RAND -c -o RandomElection.o RandomElection.cpp RandomElection.cpp: In member function `virtual void

Re: [EM] updated graphs

The approval with poll is similar to the condorcet: 3A - maybe a slight difference at the bottom on the red region 3B - slight difference at the bottom of the green region 3C - no diff 4A - no diff 4B - blue top edge is not a line 4C - increase to blue region ... wierd However, even

Re: [EM] Would would you say about a method that gives a seat to a 1-person state?

[EMAIL PROTECTED] wrote: From: [EMAIL PROTECTED] The examples dramatize Hill's bias, but would could be more dramatic than this?: If we dildn't have the 1-free-seat-for-each-state rule, Hill would give everyone a seat anyway, but Hill's own rules. It would give a seat to any

Re: [EM] Theorems about Yee/Bolson pictures

On Tue, 19 Dec 2006, Warren Smith wrote: Theorems about Yee/Bolson pictures Well, I wrote about 20 emails to Ka-Ping Yee and he hasn't responded... I do appreciate your enthusiasm about the topic, but I have to admit, 14 messages in four days is quite a barrage! Forgive me for being too busy