1 resultado para crack tip

em Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We show that optimal partisan redistricting with geographical constraints is a computationally intractable (NP-complete) problem. In particular, even when voter's preferences are deterministic, a solution is generally not obtained by concentrating opponent's supporters in \unwinnable" districts ("packing") and spreading one's own supporters evenly among the other districts in order to produce many slight marginal wins ("cracking").