Priced gerrymandering
From MaRDI portal
Publication:6093576
Recommendations
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)