DeepAI AI Chat
Log In Sign Up

Fair redistricting is hard

08/27/2018
by   Richard Kueng, et al.
The Ohio State University
0

Gerrymandering is a long-standing issue within the U.S. political system, and it has received scrutiny recently by the U.S. Supreme Court. In this note, we prove that deciding whether there exists a fair redistricting among legal maps is NP-hard. To make this precise, we use simplified notions of "legal" and "fair" that account for desirable traits such as geographic compactness of districts and sufficient representation of voters. The proof of our result is inspired by the work of Mahanjan, Minbhorkar and Varadarajan that proves that planar k-means is NP-hard.

READ FULL TEXT
10/14/2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

We prove that deciding whether the Runner can win this turn (mate-in-1) ...
06/21/2001

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

We show that computing the lexicographically first four-coloring for pla...
06/13/2021

On the Complexity of Fair House Allocation

We study fairness in house allocation, where m houses are to be allocate...
08/12/2019

Link Crossing Number is NP-hard

We show that determining the crossing number of a link is NP-hard. For s...
03/08/2011

On Minimal Constraint Networks

In a minimal binary constraint network, every tuple of a constraint rela...
12/04/2018

Rigid Foldability is NP-Hard

In this paper, we show that deciding rigid foldability of a given crease...
10/19/2015

Clustering is Easy When ....What?

It is well known that most of the common clustering objectives are NP-ha...