Standard intuitions for optimal gerrymandering involve concentrating one's extreme opponents in "unwinnable" districts ("packing") and spreading one's supporters evenly over "winnable" districts ("cracking"). These intuitions come from models with either no uncertainty about voter preferences or only two voter types. In contrast, we characterize the solution to a problem in which a gerrymanderer observes a noisy signal of voter preferences from a continuous distribution and creates N districts of equal size to maximize the expected number of districts she wins. Under mild regularity conditions, we show that cracking is never optimal -- one's most ardent supporters should be grouped together. Moreover, for sufficiently precise signals, the optimal solution involves creating a district that matches extreme "Republicans" with extreme "Democrats," and then continuing to match toward the center of the signal distribution. (JEL D72)
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).
Related research
Keywords:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)