Priced gerrymandering

DOI10.1016/J.TCS.2023.114080zbMATH Open1522.91102OpenAlexW4385076128MaRDI QIDQ6093576FDOQ6093576

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

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

zbMATH Keywords

gerrymanderingalgorithmcomplexitycontrolvotingcomputational social choice

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Algorithms for gerrymandering over graphs
• The complexity of gerrymandering over graphs: paths and trees
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• Priced gerrymandering

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)