DeepAI AI Chat
Log In Sign Up

Gerrymandering Trees: Parameterized Hardness

by   Andrew Fraser, et al.

In a representative democracy, elections involve partitioning geographical space into districts which each elect a single representative. Legislation is then determined by votes from these representatives, and thus political parties are incentivized to win as many districts as possible (ideally a plurality). Gerrymandering is the process by which these districts' boundaries are manipulated to give favor to a certain candidate or party. Cohen-Zemach et al. (AAMAS 2018) proposed Gerrymandering as a formalization of this problem on graphs (as opposed to Euclidean space) where districts partition vertices into connected subgraphs. More recently, Gupta et al. (SAGT 2021) studied its parameterized complexity and gave an FPT algorithm for paths with respect to the number of districts k. We prove that Gerrymandering is W[2]-hard on trees (even when the depth is two) with respect to k, answering an open question of Gupta et al. Moreover, we prove that Gerrymandering remains W[2]-hard in trees with ℓ leaves with respect to the combined parameter k+ℓ. To complement this result, we provide an algorithm to solve Gerrymandering that is FPT in k when ℓ is a fixed constant.


page 1

page 2

page 3

page 4


The Complexity of Gerrymandering Over Graphs: Paths and Trees

Roughly speaking, gerrymandering is the systematic manipulation of the b...

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], ...

Solving Routing Problems via Important Cuts

We introduce a novel approach of using important cuts which allowed us t...

Gerrymandering on graphs: Computational complexity and parameterized algorithms

Partitioning a region into districts to favor a particular candidate or ...

Training Neural Networks is NP-Hard in Fixed Dimension

We study the parameterized complexity of training two-layer neural netwo...

Partitioning a graph into degenerate subgraphs

Let G = (V, E) be a graph with maximum degree k≥ 3 distinct from K_k+1. ...

Almost Consistent Systems of Linear Equations

Checking whether a system of linear equations is consistent is a basic c...