Don't Trust A Single Gerrymandering Metric
Thomas Ratliff, Stephanie Somersille, Ellen Veomett

TL;DR
This paper demonstrates that common gerrymandering metrics can be manipulated to produce extreme partisan maps, questioning their reliability as standalone measures for fairness in districting.
Contribution
It shows that widely used gerrymandering metrics are gameable and unreliable when used in isolation, highlighting the need for more robust assessment methods.
Findings
Metrics can be manipulated to produce extreme partisan maps.
Extreme metric values do not necessarily indicate extreme partisan outcomes.
Metrics perform no better than simply counting districts won by a party.
Abstract
In recent years, in an effort to promote fairness in the election process, a wide variety of techniques and metrics have been proposed to determine whether a map is a partisan gerrymander. The most accessible measures, requiring easily obtained data, are metrics such as the Mean-Median Difference, Efficiency Gap, Declination, and GEO metric. But for most of these metrics, researchers have struggled to describe, given no additional information, how a value of that metric on a single map indicates the presence or absence of gerrymandering. Our main result is that each of these metrics is gameable when used as a single, isolated quantity to detect gerrymandering (or the lack thereof). That is, for each of the four metrics, we can find district plans for a given state with an extremely large number of Democratic-won (or Republican-won) districts while the metric value of that plan falls…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Advanced Graph Theory Research · graph theory and CDMA systems
