Optimal partisan districting on planar geographies |
| |
| Authors: | Balázs Fleiner Balázs Nagy Attila Tasnádi |
| |
| Institution: | 1.Department of Mathematics,Corvinus University of Budapest,Budapest,Hungary;2.MTA-BCE “Lendület” Strategic Interactions Research Group, Department of Mathematics,Corvinus University of Budapest,Budapest,Hungary |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
