This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Measuring the Compactness of Political Districting Plans

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Roland G. Fryer, Jr
Richard T. Holden

Additional information is available for the following registered author(s):

Abstract

The United States Supreme Court has long recognized compactness as an important principle in assessing the constitutionality of political districting plans. We propose a measure of compactness based on the distance between voters within the same district relative to the minimum distance achievable -- which we coin the relative proximity index. We prove that any compactness measure which satisfies three desirable properties (anonymity of voters, efficient clustering, and invariance to scale, population density, and number of districts) ranks districting plans identically to our index. We then calculate the relative proximity index for the 106th Congress, requiring us to solve for each state's maximal compactness; an NP-hard problem. Using two properties of maximally compact districts, we prove they are power diagrams and develop an algorithm based on these insights. The correlation between our index and the commonly-used measures of dispersion and perimeter is -.22 and -.06, respectively. We conclude by estimating seat-vote curves under maximally compact districts for several large states. The fraction of additional seats a party obtains when their average vote increases is significantly greater under maximally compact districting plans, relative to the existing plans.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.nber.org/papers/w13456.pdf
File Format: application/pdf
File Function:
Download Restriction: Access to the full text is generally limited to series subscribers, however if the top level domain of the client browser is in a developing country or transition economy free access is provided. More information about subscriptions and free access is available at http://www.nber.org/wwphelp.html.

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.

Publisher Info
Paper provided by National Bureau of Economic Research, Inc in its series NBER Working Papers with number 13456.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: Oct 2007
Date of revision:
Handle: RePEc:nbr:nberwo:13456

Note: LS PE POL
Contact details of provider:
Postal: National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A.
Phone: 617-868-3900
Email:
Web page: http://www.nber.org
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords:

Find related papers by JEL classification:
H70 - Public Economics - - State and Local Government; Intergovernmental Relations - - - General
K19 - Law and Economics - - Basic Areas of Law - - - Other

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? IDEAS also computes impact factors for journals and working paper series.

This page was last updated on 2008-7-24.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.