Help
Cart
Skip main navigation

Available Issues

February 19, 2019 - May 1, 2026

Available Issues

February 19, 2019 - May 1, 2026

Facilitating Compromise in Redistricting with Transfer Distance Midpoints

Published Online:2 Aug 2024https://doi.org/10.1287/ijoo.2023.0029

References

  • Abrishami T, Guillen N, Rule P, Schutzman Z, Solomon J, Weighill T, Wu S (2020) Geometry of graph partitions via optimal transport. SIAM J. Sci. Comput. 42(5):A3340–A3366.Google Scholar
  • Akitaya HA, Jones MD, Korman M, Korten O, Meierfrankenfeld C, Munje MJ, Souvaine DL, et al. (2023) Reconfiguration of connected graph partitions. J. Graph Theory 102(1):35–66.Google Scholar
  • Almudevar A, Field C (1999) Estimation of single-generation sibling relationships based on DNA markers. J. Agricultural Biological Environment. Statist. 4(2):136–165.Google Scholar
  • Arredondo V, Martínez-Panero M, Peña T, Ricca F (2021) Mathematical political districting taking care of minority groups. Ann. Oper. Res. 305(1–2):375–402.Google Scholar
  • Becker A, Gold D (2022) The gameability of redistricting criteria. J. Comput. Soc. Sci. 5(2):1735–1777.Google Scholar
  • Birge JR (1983) Redistricting to maximize the preservation of political boundaries. Soc. Sci. Res. 12(3):205–214.Google Scholar
  • Borgwardt S, Happach F, Zirkelbach S (2023) An algorithm for the separation-preserving transition of clusterings. INFORMS J. Optim. 5(1):1–26.Link, Google Scholar
  • Bose P, Dujmović V, Hurtado F, Morin P (2009) Connectivity-preserving transformations of binary images. Comput. Vision Image Understanding 113(10):1027–1038.Google Scholar
  • Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144(1):12–26.Google Scholar
  • Brams SJ (2020) Making partisan gerrymandering fair: One old and two new methods. Soc. Sci. Quart. 101(1):68–72.Google Scholar
  • Brams SJ, Merrill S III (1983) Equilibrium strategies for final-offer arbitration: There is no median convergence. Management Sci. 29(8):927–941.Link, Google Scholar
  • Cardoso JS, Corte-Real L (2005) Toward a generic evaluation of image segmentation. IEEE Trans. Image Processing 14(11):1773–1782.Google Scholar
  • Chikina M, Frieze A, Pegden W (2017) Assessing significance in a Markov chain without mixing. Proc. Natl. Acad. Sci. USA 114(11):2860–2864.Google Scholar
  • Cho WKT, Liu YY (2021) A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions. Statist. Comput. 31(10):2860–2864.Google Scholar
  • Day WH (1981) The complexity of computing metric distance between partitions. Math. Social Sci. 14(11):269–287.Google Scholar
  • DeFord D, Duchin M, Solomon J (2021) Recombination: A family of Markov chains for redistricting. Harvard Data Sci. Rev. 3(1):1–67.Google Scholar
  • Dobbs KW (2024) Optimization methods for political redistricting. PhD dissertation, University of Illinois, Urbana-Champaign.Google Scholar
  • Dobbs KW, King DM, Jacobson SH (2023) Redistricting optimization with recombination: A local search case study. Comput. Oper. Res. 160(1):1–19.Google Scholar
  • Dobbs KW, Swamy R, King DM, Ludden IG, Jacobson SH (2024) An optimization case study in analyzing Missouri redistricting. Informs J. Appl. Analytics 54(2):162–187.Link, Google Scholar
  • Esmaeili SA, Chakrabarti D, Grape H, Brubach B (2024) Implications of distance over redistricting maps: Central and outlier maps. Proc. Conf. AAAI Artificial Intelligence 38(9):9679–9687.Google Scholar
  • Fifield B, Higgins M, Imai K, Tarr A (2020) Automated redistricting simulation using Markov chain Monte Carlo. J. Comput. Graphical Statist. 29(4):715–728.Google Scholar
  • Guénoche A (2011) Consensus of partitions: A constructive approach. Adv. Data Anal. Classification 5(3):215–229.Google Scholar
  • Gusfield D (2002) Partition-distance: A problem and class of perfect graphs arising in clustering. Inform. Processing Lett. 82(3):159–164.Google Scholar
  • Hess S, Weaver J, Siegfeldt H, Whelan J, Zitlau P (1965) Nonpartisan political redistricting by computer. Oper. Res. 13(6):998–1006.Link, Google Scholar
  • Jaccard P (1912) The distribution of the flora in the alpine zone. New Phytology 11(2):37–50.Google Scholar
  • King DM, Jacobson SH, Sewell EC, Cho WKT (2012) Geo-graphs: An efficient model for enforcing contiguity and hole constraints in planar graph partitioning. Oper. Res. 60(5):1213–1228.Link, Google Scholar
  • Komuravelli A, Sinha A, Bishnu A (2009) Connectivity preserving transformations for higher dimensional binary images. Discrete Appl. Math. 157(16):3372–3385.Google Scholar
  • Konovalov DA, Litow B, Bajema N (2005) Partition-distance via the assignment problem. Bioinformatics 21(10):2463–2468.Google Scholar
  • Liu YY, Cho WKT (2020) A spatially explicit evolutionary algorithm for the spatial partitioning problem. Appl. Soft Comput. 90:106–129.Google Scholar
  • Liu YY, Cho WKT, Wang S (2016) PEAR: A massively parallel evolutionary computation approach for political redistricting optimization and analysis. Swarm Evolution Comput. 30:78–92.Google Scholar
  • Ludden IG, Swamy R, King DM, Jacobson SH (2023) A bisection protocol for political redistricting. INFORMS J. Optim. 5(3):233–255.Link, Google Scholar
  • Missouri Office of Administration (2022a) 2021–2022 citizens redistricting commission process. Accessed July 10, 2023, https://oa.mo.gov/budget-planning/redistricting-office/2020-Redistricting-Information.Google Scholar
  • Missouri Office of Administration (2022b) 2022 judicial redistricting commission process. Accessed July 10, 2023, https://oa.mo.gov/2022-judicial-redistricting-commission-process.Google Scholar
  • National Conference of State Legislatures (2021a) Creation of redistricting commissions. Accessed July 9, 2023, https://www.ncsl.org/redistricting-and-census/creation-of-redistricting-commissions.Google Scholar
  • National Conference of State Legislatures (2021b) Redistricting criteria. Accessed June 29, 2023, https://www.ncsl.org/research/redistricting/redistricting-criteria.aspx.Google Scholar
  • News-Press NOW (2021) Missouri’s redistricting cop-out. Accessed October 23, 2023, https://www.newspressnow.com/opinion/editorials/missouris-redistricting-cop-out/article_97ee2fb4-6727-11ec-9740-7726ce11bb1a.html.Google Scholar
  • Oehrlein J, Haunert JH (2017) A cutting-plane method for contiguity-constrained spatial aggregation. J. Spatial Inform. Sci. (15):89–120.Google Scholar
  • Pegden W, Procaccia AD, Yu D (2017) A partisan districting protocol with provably nonpartisan outcomes. Preprint, submitted October 2017, https://arxiv.org/abs/1710.08781.Google Scholar
  • Pereira FT, Figueira JR, Mousseau V, Roy B (2009) Comparing two territory partitions in districting problems: Indices and practical issues. Socio-Econom. Planning Sci. 43(1):72–88.Google Scholar
  • Pinto da Costa JF, Rao P (2004) Central partition for a partition-distance and strong pattern graph. REVSTAT 2(2):127–143.Google Scholar
  • Poulin V, Théberge F (2021) Comparing graph clusterings: Set partition measures vs. graph-aware measures. IEEE Trans. Pattern Anal. Machine Intelligence 43(6):2127–2132.Google Scholar
  • Rand WM (1971) Objective criteria for the evaluation of clustering methods. J. Amer. Statist. Assoc. 66(366):846–850.Google Scholar
  • Régnier S (1965) Sur quelques aspects mathématiques des problèmes de classification automatique. ICC Bull. 4:175–191.Google Scholar
  • Reynolds v Sims (1964) 377 U.S. 533.Google Scholar
  • Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur. J. Oper. Res. 189(3):1409–1426.Google Scholar
  • Ricca F, Scozzari A, Simeone B (2013) Political districting: From classical models to recent approaches. Ann. Oper. Res. 204(1):271–299.Google Scholar
  • Ríos-Mercado RZ, ed. (2020) Optimal Districting and Territory Design (Springer, Cham, Switzerland).Google Scholar
  • Salazar-Aguilar MA, Ríos-Mercado RZ, Cabrera-Ríos M (2011) New models for commercial territory design. Network Spatial Econom. 11(3):487–507.Google Scholar
  • Shirabe T (2009) Districting modeling with exact contiguity constraints. Environment. Planning B Planning Design 36(6):1053–1066.Google Scholar
  • Swamy R, King DM, Jacobson SH (2022) Multi-objective optimization for politically fair districting: A scalable multilevel approach. Oper. Res. 71(2):536–562.Google Scholar
  • Swamy R, King DM, Ludden IG, Dobbs KW, Jacobson SH (2024) A practical optimization framework for political redistricting: A case study in Arizona. Socio-Econom. Planning Sci. 92(1):1–18.Google Scholar
  • U.S. Census Bureau (2020a) 2020 census: Apportionment of the U.S. House of Representatives. Accessed May 27, 2022.Google Scholar
  • U.S. Census Bureau (2020b) Race. Accessed September 12, 2023, https://data.census.gov/table?g=040XX00US29$1000000&tid=DECENNIALPL2020.P1.Google Scholar
  • U.S. Census Bureau (2020c) TIGER/line shapefiles. Accessed October 19, 2023, https://www.census.gov/geographies/mapping-files/time-series/geo/tiger-line-file.2020.html.Google Scholar
  • Validi H, Buchanan A (2022) Political districting to minimize cut edges. Math. Programming Comput. 14(4):623–672.Google Scholar
  • Validi H, Buchanan A, Lykhovyd E (2021) Imposing contiguity constraints in political districting models. Oper. Res. 70(2):867–892.Link, Google Scholar
  • Voting Rights Data Institute (2018) GerryChain. Accessed October 19, 2023, https://github.com/mggg/GerryChain.Google Scholar
  • Wesberry v Sanders (1964) 376 U.S. 1.Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree