Compactness in districting is not as much of a constraint on gerrymandering as you might think

Macartan Humphreys sends along this article where he proves that the requirement of “compactness” in districting, if interpreted as requiring districts to be convex, does not by itself stop a majority party from gerrymandering:

Gerrymandering–the manipulation of electoral boundaries to maximize constituency wins|is often seen as a pathology of democratic systems. A commonly cited cure is to require that electoral constituencies have a `compact’ shape. But how much of a constraint does compactness in fact place on would-be gerrymanderers? By applying a theorem of Kaneko, Kano, and Suzuki (2004) to the two party situation we show that a gerrymanderer can always create equal sized convex constituencies that translate a margin of k voters into a margin of at least k constituency wins. Thus even with a small margin a majority party can win all constituencies. Moreover there always exists some population distribution such that all divisions into equal sized convex constituencies translate a margin of k voters into a margin of exactly k constituencies. Thus a convexity constraint can sometimes prevent a gerrymanderer from generating any wins for a minority party.

1 thought on “Compactness in districting is not as much of a constraint on gerrymandering as you might think

  1. The modeling of voters as points in general position seems rather unrealistic. I'd be interested in seeing some justification about this model choice.

    Thanks for linking to this literature though, I was unaware of it and I'd always wondered if people had done some scientific work in it.

Comments are closed.