Abstract
Gerrymandering - the artful and partisan manipulation of electoral districts - is a well known pathology of electoral systems, especially majoritarian ones. In this paper, we try to give theoretical and experimental answers to the following questions: 1) How much biased can the assignment of seats be under the effect of gerrymandering? 2) How effective is compactness as a remedy against gerrymandering? Accordingly, the paper is divided into two parts. In the first one, a highly stylized combinatorial model of gerrymandering is studied; in the second one, a more realistic multiobjective graph-partitioning model is adopted and local search techniques are exploited in order to find satisfactory district designs. In a nutshell, our results for the theoretical model mean that gerrymandering is as bad as one can think of and that compactness is as good as one can think of. These conclusions are confirmed to a large extent by the experimental results obtained with the latter model on some medium-large real-life test problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
