Weighted Voronoi Region Algorithms for Political Districting

Authors Bruno Simeone, Federica Ricca, Andrea Scozzari



PDF
Thumbnail PDF

File

DagSemProc.07311.9.pdf
  • Filesize: 273 kB
  • 15 pages

Document Identifiers

Author Details

Bruno Simeone
Federica Ricca
Andrea Scozzari

Cite AsGet BibTex

Bruno Simeone, Federica Ricca, and Andrea Scozzari. Weighted Voronoi Region Algorithms for Political Districting. In Frontiers of Electronic Voting. Dagstuhl Seminar Proceedings, Volume 7311, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.07311.9

Abstract

Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can be modelled as multiobjective partitioning of a graph into connected components, where population equality and compactness must hold if a majority voting rule is adopted. This leads to the formulation of combinatorial optimization problems that are extremely hard to solve exactly. We propose a class of heuristics, based on discrete weighted Voronoi regions, for obtaining compact and balanced districts, and discuss some formal properties of these algorithms. Their performance has been tested on randomly generated rectangular grids, as well as on real-life benchmarks; for the latter instances the resulting district maps are compared with the institutional ones adopted in the Italian political elections from 1994 to 2001.
Keywords
  • Political districting
  • weighted Voronoi regions
  • graph partitioning
  • heuristics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail