[EM] A computationally feasible method (algorithmic redistricting)

[Raph Frank]

On Wed, Sep 3, 2008 at 8:46 PM, Jonathan Lundell <jlundell at pobox.com> wrote:
> OK, we could solve that in principle (though not too quickly) by using
> Google Maps driving time, or the like. But what does driving time have to do
> with grouping voters (unless we're drawing a precinct and measuring travel
> time t the polling place)?

I completely agree.  Proportional representation is superior to single
seat districts.  It in effect allows people to design their own
districts.

However, if you are going to have single seat districts, then you
might as well come up with an unbiased method for creating them.

The ideal algorithm is one that is simple and comes up with reasonable
districts.  Also, it should have as few free parameters as possible.
This prevents politicians from abusing their power and designing the
districts to keep themselves in power.

However, even something like "they should be compact" favours some
people.  If you are part of a group that is spread evenly, then you do
worse if the districts are compact.  The problem is that philosophy
that districts should be geographically based.