How to gerrymander: A formal analysis
The paper combines the optimal gerrymandering approach in political science with the “fair cake division” results in mathematics and economics to consider optimal partisan gerrymandering schemes on a given territory. We analyze existence and properties of an optimal districting map for a strategic party that has control over redistricting process, given arbitrary continuous distributions of voters and party supporters over the electoral territory. Interestingly, we find that imposition of certain equality-type constraints on districting might often help to prevent gerrymandering and sustain fairness. Copyright Kluwer Academic Publishers 1998
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 95 (1998)
Issue (Month): 1 (April)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/public+finance/journal/11127/PS2|
References listed on IDEAS
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.:
- Brams, S.J. & Taylor, A.D., 1992. "An Envy-Free Cake Division Algorithm," Working Papers 92-31, C.V. Starr Center for Applied Economics, New York University.
- Berliant, Marcus & Thomson, William & Dunz, Karl, 1992. "On the fair division of a heterogeneous commodity," Journal of Mathematical Economics, Elsevier, vol. 21(3), pages 201-216.