The self-limiting partisan gerrymander: an optimization approach

DOI10.4169/COLLEGE.MATH.J.45.5.338MaRDI QIDQ3195423zbMATH OpenOpenAlexFDO

Authors Jeff Suzuki

Publication date 19 October 2015

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/college.math.j.45.5.338

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Operations research, economics (aspects of mathematics education) (97M40) Mathematical programming (educational aspects) (97N60)

Recommendations

• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• Optimal partisan districting on planar geographies
• Partisan gerrymandering with geographically compact districts
• An impossibility theorem for gerrymandering
• On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering

Cited in

(7)

• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• Gerrymandering in a hierarchical legislature
• Fairness in plurality systems with implications for detecting partisan gerrymandering
• Partisan gerrymandering with geographically compact districts
• Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry
• Optimality and fairness of partisan gerrymandering
• Padding and pruning: gerrymandering under turnout heterogeneity

This page was built for publication: The self-limiting partisan gerrymander: an optimization approach

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