Algorithms for gerrymandering over graphs
From MaRDI portal
Publication:831130
DOI10.1016/j.tcs.2021.03.037zbMath1497.68382OpenAlexW3144552872MaRDI QIDQ831130
Takehiro Ito, Naoyuki Kamiyama, Yoshio Okamoto, Yusuke Kobayashi
Publication date: 10 May 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.03.037
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14) Algorithmic game theory and complexity (91A68)
Related Items (4)
Gerrymandering on graphs: computational complexity and parameterized algorithms ⋮ Priced gerrymandering ⋮ The complexity of gerrymandering over graphs: paths and trees ⋮ The complexity of gerrymandering over graphs: paths and trees
Cites Work
- Unnamed Item
- Bicolored graph partitioning, or: gerrymandering at its worst
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of control problems in voting systems
- Parameterized complexity of candidate control in elections and related digraph problems
- Optimal redistricting under geographical constraints: why ``pack and crack does not work
- On the complexity of partitioning graphs into connected subgraphs
- How hard is it to control an election?
- Optimal partisan districting on planar geographies
- The computational difficulty of manipulating an election
- A tabu search heuristic and adaptive memory procedure for political districting
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- An Optimization Based Heuristic for Political Districting
- More Natural Models of Electoral Control by Partition
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Control and Bribery in Voting
- Network-Based Vertex Dissolution
This page was built for publication: Algorithms for gerrymandering over graphs
