arXiv · 1510.03247
Impartial Redistricting: A Markov Chain Approach
Abstract
The gerrymandering problem is a worldwide problem which sets great threat to democracy and justice in district based elections. Thanks to partisan redistricting commissions, district boundaries are often manipulated to benefit incumbents. Since an independent commission is hard to come by, the possibility of impartially generating districts with a computer is explored in this thesis. We have developed an algorithm to randomly produce legal redistricting schemes for Pennsylvania.
Explore related subjects
Keep this discovery
Lucy Chenyun Wu, Jason Xiaotian Dou, Danny Sleator, Alan Frieze, David Miller. 2015-10-13. Impartial Redistricting: A Markov Chain Approach. https://arxiv.org/abs/1510.03247
Cite the original work for its findings. Save a collection to share your selection of sources.