Optimal redistricting under geographical constraints: why ``pack and crack does not work
From MaRDI portal
Publication:1046263
DOI10.1016/j.econlet.2009.06.008zbMath1179.91065OpenAlexW3123020175MaRDI QIDQ1046263
Attila Tasnádi, Clemens D. 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
Voting theory (91B12) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
On avoiding vote swapping ⋮ Algorithms for gerrymandering over graphs ⋮ Optimal partisan districting on planar geographies ⋮ Network-Based Dissolution ⋮ Gerrymandering on graphs: computational complexity and parameterized algorithms ⋮ Reconfiguration of connected graph partitions ⋮ Optimality and fairness of partisan gerrymandering ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections ⋮ Network-Based Vertex Dissolution
Cites Work
This page was built for publication: Optimal redistricting under geographical constraints: why ``pack and crack does not work
