Gerrymandering on graphs: Computational complexity and parameterized algorithms

02/19/2021
āˆ™
by   Sushmita Gupta, et al.
āˆ™
0
āˆ™

Partitioning a region into districts to favor a particular candidate or a party is commonly known as gerrymandering. In this paper, we investigate the gerrymandering problem in graph theoretic setting as proposed by Cohen-Zemach et al. [AAMAS 2018]. Our contributions in this article are two-fold, conceptual and computational. We first resolve the open question posed by Ito et al. [AAMAS 2019] about the computational complexity of the problem when the input graph is a path. Next, we propose a generalization of their model, where the input consists of a graph on n vertices representing the set of voters, a set of m candidates š’ž, a weight function w_v: š’žā†’ā„¤^+ for each voter vāˆˆ V(G) representing the preference of the voter over the candidates, a distinguished candidate pāˆˆš’ž, and a positive integer k. The objective is to decide if one can partition the vertex set into k pairwise disjoint connected sets (districts) s.t p wins more districts than any other candidate. The problem is known to be NPC even if k=2, m=2, and G is either a complete bipartite graph (in fact K_2,n) or a complete graph. This means that in search for FPT algorithms we need to either focus on the parameter n, or subclasses of forest. Circumventing these intractable results, we give a deterministic and a randomized algorithms for the problem on paths running in times 2.619^k(n+m)^O(1) and 2^k(n+m)^O(1), respectively. Additionally, we prove that the problem on general graphs is solvable in time 2^n (n+m)^O(1). Our algorithmic results use sophisticated technical tools such as representative set family and Fast Fourier transform based polynomial multiplication, and their (possibly first) application to problems arising in social choice theory and/or game theory may be of independent interest to the community.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
āˆ™ 04/11/2018

Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs

In algorithmic graph theory, a classic open question is to determine the...
research
āˆ™ 08/03/2022

On the Computational Complexity of the Strong Geodetic Recognition Problem

A strong geodetic set of a graphĀ G=(V,E) is a vertex setĀ S āŠ† V(G) in whi...
research
āˆ™ 05/13/2022

Gerrymandering Trees: Parameterized Hardness

In a representative democracy, elections involve partitioning geographic...
research
āˆ™ 03/09/2018

Disconnected Cuts in Claw-free Graphs

A disconnected cut of a connected graph is a vertex cut that itself also...
research
āˆ™ 05/03/2023

Computing paths of large rank in planar frameworks deterministically

A framework consists of an undirected graph G and a matroid M whose elem...
research
āˆ™ 06/24/2018

On r-Simple k-Path and Related Problems Parameterized by k/r

Abasi et al. (2014) and Gabizon et al. (2015) studied the following prob...
research
āˆ™ 08/29/2023

Graph Theory and its Uses in Graph Algorithms and Beyond

Graphs are fundamental objects that find widespread applications across ...

Please sign up or login with your details

Forgot password? Click here to reset