Gerrymandering on graphs: computational complexity and parameterized algorithms
From MaRDI portal
Publication:2670918
DOI10.1007/978-3-030-85947-3_10zbMath1491.91101arXiv2102.09889OpenAlexW3203672403MaRDI QIDQ2670918
Pallavi Jain, Sanjukta Roy, Fahad Panolan, Sushmita Gupta, Saket Saurabh
Publication date: 1 June 2022
Full work available at URL: https://arxiv.org/abs/2102.09889
Voting theory (91B12) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)
Related Items (3)
Priced gerrymandering ⋮ More effort towards multiagent knapsack ⋮ The complexity of gerrymandering over graphs: paths and trees
Cites Work
- Fundamentals of parameterized complexity
- Exact and approximate bandwidth
- Algorithms for gerrymandering over graphs
- Algorithms for the coalitional manipulation problem
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Parameterized complexity of candidate control in elections and related digraph problems
- Optimal redistricting under geographical constraints: why ``pack and crack does not work
- Optimal partisan districting on planar geographies
- Structured proportional representation
- Parameterized computational complexity of Dodgson and Young elections
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- Narrow sieves for parameterized paths and packings
- Graph Theory
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Copeland Voting Fully Resists Constructive Control
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Network-Based Vertex Dissolution
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gerrymandering on graphs: computational complexity and parameterized algorithms
