文章基本信息

标题：Maximizing gerrymandering through ising model optimization
本地全文：下载
作者：Yasuharu Okamoto
期刊名称：Scientific Reports
电子版ISSN：2045-2322
出版年度：2021
卷号：11
DOI：10.1038/s41598-021-03050-z
语种：English
出版社：Springer Nature
摘要：By using the Ising model formulation for combinatorial optimization with 0–1 binary variables, we investigated the extent to which partisan gerrymandering is possible from a random but even distribution of supporters. Assuming that an electoral district consists of square subareas and that each subarea shares at least one edge with other subareas in the district, it was possible to find the most tilted assignment of seats in most cases. However, in cases where supporters' distribution included many enclaves, the maximum tilted assignment was usually found to fail. We also discussed the proposed algorithm is applicable to other fields such as the redistribution of delivery destinations.