Abstract
AbstractBy using the Ising model formulation for combinatorial optimization with 0–1 binary variables, we investigated the extent to which partisan gerrymandering is possible from a random but even distribution of supporters. Assuming that an electoral district consists of square subareas and that each subarea shares at least one edge with other subareas in the district, it was possible to find the most tilted assignment of seats in most cases. However, in cases where supporters' distribution included many enclaves, the maximum tilted assignment was usually found to fail. We also discussed the proposed algorithm is applicable to other fields such as the redistribution of delivery destinations.
Funder
New Energy and Industrial Technology Development Organization
Publisher
Springer Science and Business Media LLC
Reference30 articles.
1. Berman, M. N. Managing Gerrymandering. Faculty Scholarship at Penn Law. 1470 (2005).
2. Amy, D. J. Real choices/new voices: The Case for Proportional Representation Elections in the United States (Columbia. Univ, 1993).
3. Dickson, P. & Clancy, P. The congress dictionary: The ways and meanings of Capitol Hill (Wiley, 1993).
4. Vickrey, W. On the prevention of Gerrymandering. Polit. Sci. Q. 76, 105 (1961).
5. Niemi, R. G., Grofman, B., Carlucci, C. & Hofeller, T. Measuring compactness and the role of a compactness standard in a test for partisan and racial Gerrymandering. J. Polit. 52, 1155 (1990).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献