Optimal partisan districting on planar geographies

We show that optimal partisan districting and majority securing districting in the plane with geographical constraints are NP-complete problems. We provide a polynomial time algorithm for determining an optimal partisan districting for a simplified version of the problem. In addition, we give possible explanations for why finding an optimal partisan districting for real-life problems cannot be guaranteed.

MoreLess

Year of publication:	2017
Authors:	Fleiner, Balázs ; Nagy, Balázs ; Tasnádi, Attila
Publisher:	Springer
Subject:	Mathematics \| Econometrics

More details

Type of publication:	Article
Language:	English
Notes:	Fleiner, Balázs, Nagy, Balázs and Tasnádi, Attila (2017) Optimal partisan districting on planar geographies. Central European Journal of Operations Research, 25 (4). pp. 879-888. DOI https://doi.org/10.1007/s10100-016-0454-7
Other identifiers:	10.1007/s10100-016-0454-7 [DOI]
Source:	BASE

Persistent link: https://www.econbiz.de/10012493073