Gerrymandering by Algorithm
Using computer algorithms to draw electoral district boundaries to maximize partisan advantage efficiently and subtly.
Updated April 23, 2026
How It Works
Gerrymandering by algorithm involves using computer programs and mathematical techniques to draw electoral district boundaries in a way that maximizes political advantage for a particular party or group. Unlike traditional manual redistricting, which can be time-consuming and less precise, algorithms can analyze vast amounts of demographic and voting data to create highly efficient maps that concentrate or dilute certain voting populations. These algorithms optimize district shapes and compositions to secure more seats than the party’s overall vote share might suggest.
Why It Matters
This technique drastically changes the landscape of representative democracy because it can entrench political power and reduce electoral competitiveness. When districts are drawn algorithmically to favor one party, it can lead to skewed election outcomes, where the distribution of seats does not reflect the actual preferences of the electorate. This undermines voter influence, decreases accountability, and can exacerbate political polarization by creating “safe” districts where incumbents face little challenge.
Gerrymandering by Algorithm vs Traditional Gerrymandering
Traditional gerrymandering is often a manual process driven by political operatives using maps and demographic data to carve out districts favoring their party. It can be visible and sometimes crude, with oddly shaped districts. Algorithmic gerrymandering automates this process, allowing for more subtle, precise, and optimized boundary drawing. While traditional methods might rely on heuristics and political judgment, algorithms can test millions of map configurations rapidly, selecting those that maximize partisan advantage while appearing compact or natural.
Real-World Examples
One notable example occurred in North Carolina during the 2010s, where advanced computer algorithms were reportedly used to redraw congressional districts favoring Republicans. The resulting maps were challenged in court for being excessively partisan and diluting the voting power of certain communities. Similar techniques have been used in other U.S. states and around the world, raising concerns about fairness and transparency in the redistricting process.
Common Misconceptions
A common misconception is that algorithmic gerrymandering is purely objective because it uses computers. In reality, algorithms are designed and guided by humans with political goals, meaning the process can be just as biased as manual gerrymandering but potentially more effective. Another misunderstanding is that algorithms always produce neat and compact districts; however, they can generate complex shapes that meet partisan objectives while superficially complying with legal requirements.
Efforts to Counter Algorithmic Gerrymandering
Awareness of algorithmic gerrymandering has led to calls for independent redistricting commissions, transparency in mapping algorithms, and the use of neutral or fairness-focused algorithms that aim to create competitive and representative districts. Some groups develop open-source software that generates multiple fair maps to compare against proposed plans, helping to identify partisan bias.
Example
In North Carolina, sophisticated algorithms were used in the 2010s to redraw congressional districts, sparking legal challenges due to resulting partisan bias favoring Republicans.
Covered in