2026-07-22T21:03:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1302 2024-03-06T11:07:39Z ddc:004 open_access

Weighted Voronoi Region Algorithms for Political Districting Simeone, Bruno Ricca, Federica Scozzari, Andrea Political districting weighted Voronoi regions graph partitioning heuristics 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bruno Simeone and Federica Ricca and Andrea Scozzari 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7311, Frontiers of Electronic Voting (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07311.9 urn:nbn:de:0030-drops-13024 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07311.9 eng https://creativecommons.org/licenses/by/4.0/legalcode