If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Optimal Gerrymandering: Sometimes Pack, But Never Crack

$19.00 plus tax (Refund Policy)

Buy Article:

Abstract:

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.

Document Type: Research Article

DOI: http://dx.doi.org/10.1257/aer.98.1.113

Publication date: March 1, 2008

More about this publication?
Related content

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more