Optimal redistricting under geographical constraints: why ``pack and crack does not work

DOI10.1016/J.ECONLET.2009.06.008MaRDI QIDQ1046263zbMATH OpenOpenAlexFDO

Authors Attila Tasnádi, Clemens Puppe

Publication date 21 December 2009

Published in Economics Letters (Search for Journal in Brave)

Full work available at URL http://unipub.lib.uni-corvinus.hu/275/1/Puppe_Tasnadi_EL_2009_v105_p93.pdf

zbMATH Keywords

gerrymanderingNP-complete problemsdistricting

Mathematics Subject Classification ID

History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)

Recommendations

• Optimal partisan districting on planar geographies
• Fair redistricting is hard
• A computational approach to unbiased districting
• The self-limiting partisan gerrymander: an optimization approach
• Algorithms for gerrymandering over graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A computational approach to unbiased districting

Cited in

(20)

• Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry
• Network-based dissolution
• A computational approach to unbiased districting
• Algorithms for gerrymandering over graphs
• Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
• A discrete districting plan
• On avoiding vote swapping
• Optimal partisan districting on planar geographies
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• Network-based vertex dissolution
• A graph partitioning model of congressional redistricting
• Reconfiguration of connected graph partitions
• The self-limiting partisan gerrymander: an optimization approach
• Padding and pruning: gerrymandering under turnout heterogeneity
• Fair redistricting is hard
• Redistricting algorithms
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
• Optimality and fairness of partisan gerrymandering
• A fast sorting algorithm to redistricting election model

This page was built for publication: Optimal redistricting under geographical constraints: why ``pack and crack does not work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046263)