A computational approach to unbiased districting

DOI10.1016/J.MCM.2008.05.024MaRDI QIDQ2389779zbMATH OpenOpenAlexFDO

Authors Attila Tasnádi, Clemens Puppe

Publication date 18 July 2009

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

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

zbMATH Keywords

gerrymanderingredistrictingNP-complete problems

Mathematics Subject Classification ID

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

Recommendations

• Fair redistricting is hard
• Optimal partisan districting on planar geographies
• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• Axiomatic districting
• A discrete districting plan

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An optimization based heuristic for political districting
• On the complexity of approximating \(k\)-set packing
• Optimal Political Districting by Implicit Enumeration Techniques

Cited in

(15)

• Voting Rights, Markov Chains, and Optimization by Short Bursts
• A discrete districting plan
• Optimal partisan districting on planar geographies
• Bicolored graph partitioning, or: gerrymandering at its worst
• Priced gerrymandering
• Fair division and redistricting
• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• Fair redistricting is hard
• Computational geometric approaches to equitable districting: a survey
• Reconfiguration of connected graph partitions
• Network-based dissolution
• A fair division solution to the problem of redistricting
• Axiomatic districting
• Network-based vertex dissolution
• An Exact Solution Method for the Political Districting Problem

This page was built for publication: A computational approach to unbiased districting

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