Combating Gerrymandering with Ranked Choice Voting: An Experimental Analysis of Multimember Districts in the United States

Published Online:https://doi.org/10.1287/opre.2024.1167

Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States—winner-take-all single-member districts—both enables substantial partisan gerrymandering and constrains fair redistricting, preventing proportional representation in legislatures. We study the design of multimember districts (MMDs), in which each district elects multiple representatives, potentially through a non–winner-take-all voting rule. We carry out large-scale empirical analyses for the U.S. House of Representatives under MMDs with different social choice functions and algorithmically generated maps optimized for either partisan benefit or proportionality. Doing so requires efficiently incorporating predicted partisan outcomes—under various multiwinner social choice functions—into an algorithm that optimizes over an ensemble of maps. We find that, with three-member districts using single transferable vote, fairness-minded independent commissions would be able to achieve proportional outcomes in every state up to rounding, and advantage-seeking partisans would have their power to gerrymander significantly curtailed. Simultaneously, such districts would preserve geographic cohesion. Through simulation, we find that the insights are robust to cross-party voting. In the process, we advance a rich research agenda at the intersection of social choice and computational gerrymandering.

Funding: N. Garg was supported by the National Science Foundation Division of Information and Intelligent Systems [Grant CAREER IIS-2339427], and Cornell Tech Urban Tech Hub, Google, Meta, and Amazon research awards.

Supplemental Material: All supplemental materials, including the code, data, and files required to reproduce the results, are available at https://doi.org/10.1287/opre.2024.1167.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.