On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
DOI10.1007/s10878-020-00589-xzbMath1444.91184OpenAlexW3033561919MaRDI QIDQ782765
Tanima Chatterjee, Zainab Al-Qurashi, Laura Palmieri, Anastasios Sidiropoulos, Bhaskar Das Gupta
Publication date: 29 July 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00589-x
Analysis of algorithms (68W40) Voting theory (91B12) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- Approximation algorithms for NP-complete problems on planar graphs
- Model Selection and Multimodel Inference
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
This page was built for publication: On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering