Optimality and fairness of partisan gerrymandering

DOI10.1007/S10107-021-01731-1OpenAlexW3211441440MaRDI QIDQ6120899FDOQ6120899

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)

Cites Work

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

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)