Optimality and fairness of partisan gerrymandering

DOI10.1007/S10107-021-01731-1MaRDI QIDQ6120899zbMATH OpenOpenAlexFDO

Authors Antoine Lagarde, Tristan Tomala

Publication date 21 February 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-021-01731-1

zbMATH Keywords

fairnessgerrymanderingoptimalitydistrictingBayesian persuasion

Mathematics Subject Classification ID

History, political science (91F10) Voting theory (91B12)

Recommendations

• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• The self-limiting partisan gerrymander: an optimization approach
• Optimal partisan districting on planar geographies
• Padding and pruning: gerrymandering under turnout heterogeneity
• Fairness in plurality systems with implications for detecting partisan gerrymandering

Cites work

• Fair Majority Voting (or How to Eliminate Gerrymandering)
• Optimal information disclosure: a linear programming approach
• Optimal partisan districting on planar geographies
• Optimal redistricting under geographical constraints: why ``pack and crack does not work

Cited in

(3)

• Padding and pruning: gerrymandering under turnout heterogeneity
• Gerrymandering individual fairness
• ELECTORAL MALDISTRICTING

This page was built for publication: Optimality and fairness of partisan gerrymandering

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