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
(This abstract was borrowed from another version of this item.)
|Date of creation:||Jul 1993|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: 626 395-4065
Fax: 626 405-9841
Web page: http://www.hss.caltech.edu/ss
|Order Information:|| Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125|
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.:
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:clt:sswopa:855. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Victoria Mason)
If references are entirely missing, you can add them using this form.