美国数学建模竞赛特等奖论文——2007 A O P Electoral Redistricting with Moment of Inertia【数学建模】.pdfVIP

Electoral Redistricting with Moment of Inertia and Diminishing Halves Models Andrew Spann, Dan Gulotta, Daniel Kane Presented July 9, 2008 1 Outline 1. Introduction 2. Motivation 3. Simplifying Assumptions 4. Moment of Inertia Method 5. Diminishing Halves Methods 6. Quantitative Compactness Analysis 7. Conclusion 2 Problem Statement: Congressional Apportionment • We wish to draw congressional districts for a state. • Goal: Algorithm that avoids Gerrymandering. • Want to create “simplest” shapes. • Definition of “simple” left to problem solvers. • Only rule is that districts have equal population. 3 Gerrymandering Examples Adapted from National Atlas of the United States. 4 Motivation Many possible criteria suggested in literature. • Equality of district size • Compactness • Contiguity • Similarity to existing borders • Targeted homogeneity/heterogeneity Instead of specifying many properties, we wish to explicitly specify as few as possible. Additional properties become an emergent behavior. 5 Motivation Our algorithms will use only the criteria of 1. Equal population districts 2. Compactness Examine map afterwards to determine emergent properties. 6 Simplifying Assumptions We make the following simplifying assumptions in our model: • A 2% error tolerance from the mean in size of district population is acceptable. • Euclidean geometry: variations in longitudinal spacing