A Procedure for Nonpartisan Districting: Development of Computer Techniques

Weaver, James B.; Hess, Sidney W.

doi:10.2307/794769

Cited by 102 publications

(42 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this case, the regions are designed in order to equalize regional workload rather than regional population. The authors prefer the relaxed version proposed by Weaver and Hess (1963) where fractional assignations are adjusted a posteriori. The Hess and Samuels model is also extended by Zoltners (1979) to allow the incorporation of more than one attribute to be equalized across regions.…”

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

“…This strategy was introduced in the early 1960s by Weaver and Hess (1963) as a methodological approach to design political districts. The authors saw the opportunity to adapt the mathematical formulation for solving the warehouse location-allocation problem to the political districting problem.…”

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

“…For a given solution, the global 6 It was theoretical because solving the new formulation was computationally difficult at that time. For empirical purposes the authors continued to use the procedure proposed by Weaver and Hess (1963). 7 The use of a relative measure of compactness places more emphasis on regional shape than on regional size, since regional size depends on the spatial distribution of population when equal population is required.…”

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

“…Most of the methods derived from Weaver and Hess (1963) usually place the emphasis on regional equality, for example population or workload equality, and regional compactness. In these methods, regional homogeneity is assumed to be indirectly reached by imposing compactness.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Supervised Regionalization Methods: A Survey

Duque

Ramos

Suriñach

2007

International Regional Science Review

258

178

View full text Add to dashboard Cite

This paper reviews almost four decades of contributions on the subject of supervised regionalization methods. These methods aggregate a set of areas into a predefined number of spatially contiguous regions while optimizing certain aggregation criteria. The authors present a taxonomic scheme that classifies a wide range of regionalization methods into eight groups, based on the strategy applied for satisfying the spatial contiguity constraint. The paper concludes by providing a qualitative comparison of these groups in terms of a set of certain characteristics, and by suggesting future lines of research for extending and improving these methods.

show abstract

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Supervised Regionalization Methods: A Survey

Duque

Ramos

Suriñach

2007

International Regional Science Review

258

178

View full text Add to dashboard Cite

show abstract

“…Hofeller and Grofman (1990) propose two: the ratio of the district population to the convex hull of the district and the ratio of the district population to the smallest circumscribing circle. Weaver and Hess (1963) suggest the population moment of inertia, normalized to lie in the unit interval. Niemi et al's (1990) final miscellaneous category includes three measures: the absolute deviation of district area from average area in the state (Theobald 1970), a measure based on the number of reflexive and nonreflexive interior angles (Taylor 1973), and the sum of all pairwise distances between the centers of subunits of the district, weighted by subunit population (Papayanopolous 1973).…”

mentioning

confidence: 99%

Measuring the Compactness of Political Districting Plans

Fryer

Holden

2007

View full text Add to dashboard Cite

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. AbstractWe develop 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. Any compactness measure that 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, which requires us to solve for each state's maximal compactness-a problem that is nondeterministic polynomial-time hard (NP hard). The correlations between our index and the commonly used measures of dispersion and perimeter are Ϫ.37 and Ϫ.29, respectively. We conclude by estimating seatvote curves under maximally compact districts for several large states. The fraction of additional seats a party obtains when its average vote increases is significantly greater under maximally compact districting plans relative to the existing plans.

show abstract

Classification

Hartigan¹

2004

Encyclopedia of Statistical Sciences

View full text Add to dashboard Cite

A Procedure for Nonpartisan Districting: Development of Computer Techniques

Cited by 102 publications

References 0 publications

Supervised Regionalization Methods: A Survey

Supervised Regionalization Methods: A Survey

Measuring the Compactness of Political Districting Plans

Classification

Contact Info

Product

Resources

About