Priced gerrymandering

DOI10.1016/J.TCS.2023.114080MaRDI QIDQ6093576zbMATH OpenOpenAlexFDO

Authors Palash Dey

Publication date 7 September 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2023.114080

zbMATH Keywords

gerrymanderingalgorithmcomplexitycontrolvotingcomputational social choice

Mathematics Subject Classification ID

History, political science (91F10) Social choice (91B14) Voting theory (91B12)

Recommendations

• Algorithms for gerrymandering over graphs
• The complexity of gerrymandering over graphs: paths and trees
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• Optimal partisan districting on planar geographies
• Fair redistricting is hard

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A computational approach to unbiased districting
• Algorithms for gerrymandering over graphs
• Anyone but him: the complexity of precluding an alternative
• Axiomatic districting
• Barriers to manipulation in voting
• Control and bribery in voting
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• How hard is bribery in elections?
• How hard is it to control an election?
• More natural models of electoral control by partition
• Network-based vertex dissolution
• Partitioning graphs into connected parts
• Priced gerrymandering
• Swap bribery
• The complexity of gerrymandering over graphs: paths and trees
• The complexity of priced control in elections

Cited in

(7)

• Gerrymandering on graphs: computational complexity and parameterized algorithms
• Padding and pruning: gerrymandering under turnout heterogeneity
• Algorithms for gerrymandering over graphs
• Priced gerrymandering
• Parameterized complexity of gerrymandering
• Reconfiguration of connected graph partitions
• The complexity of gerrymandering over graphs: paths and trees

This page was built for publication: Priced gerrymandering

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