The Economics of Partisan Gerrymandering
We study the problem of a partisan gerrymanderer who assigns voters to equipopulous districts so as to maximize his party's expected seat share. The designer faces both aggregate uncertainty (how many votes his party will receive) and idiosyncratic, voter-level uncertainty (which voters will vote for his party). We argue that pack-and-pair districting, where weaker districts are `packed'' with a single type of voter, while stronger districts contain two voter types, is typically optimal for the gerrymanderer. The optimal form of pack-and-pair districting depends on the relative amounts of aggregate and idiosyncratic uncertainty. When idiosyncratic uncertainty dominates, it is optimal to pack opposing voters and pair more favorable voters; this plan resembles traditional packing-and-cracking.'' When aggregate uncertainty dominates, it is optimal to pack moderate voters and pair extreme voters; this `matching slices'' plan has received some attention in the literature. Estimating the model using precinct-level returns from recent US House elections indicates that, in practice, idiosyncratic uncertainty dominates and packing opponents is optimal; moreover, traditional pack-and-crack districting is approximately optimal. We discuss implications for redistricting reform and political polarization. Methodologically, we exploit a formal connection between gerrymandering -- partitioning voters into districts -- and information design -- partitioning states of the world into signals.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Persuasion and Matching: Optimal Productive Transport
We consider general Bayesian persuasion problems where the receiver's utility is single-peaked in a one-dimensional action. We show that a signal that pools at most two states in each realization is always optimal, and t…
Gerrymandering Planar Graphs
We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into $k$ connected component…
Implications of Distance over Redistricting Maps: Central and Outlier Maps
In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative. A valid redistricting map must satisfy a collection of constraints such as being co…
FairnessOutlier DetectionvalidDiscriminative Metric Learning by Neighborhood Gerrymandering
We formulate the problem of metric learning for k nearest neighbor classification as a large margin structured prediction problem, with a latent variable representing the choice of neighbors and the task loss directly co…
ClassificationGeneral ClassificationMetric LearningStructured PredictionTeam Jack Ryder at SemEval-2019 Task 4: Using BERT Representations for Detecting Hyperpartisan News
We describe the system submitted by the Jack Ryder team to SemEval-2019 Task 4 on Hyperpartisan News Detection. The task asked participants to predict whether a given article is hyperpartisan, i.e., extreme-left or extre…
Articles