A computational approach to unbiased districting

DOI10.1016/J.MCM.2008.05.024zbMATH Open1187.91185OpenAlexW3125499885MaRDI QIDQ2389779FDOQ2389779

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

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

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)

Cites Work

• An optimization based heuristic for political districting
• Title not available (Why is that?)
• On the complexity of approximating \(k\)-set packing
• Optimal Political Districting by Implicit Enumeration Techniques

Cited In (11)

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

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)