Impartial Redistricting: A Markov Chain Approach
Computers and Society
2015-10-14 v2
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.
Cite
@article{arxiv.1510.03247,
title = {Impartial Redistricting: A Markov Chain Approach},
author = {Lucy Chenyun Wu and Jason Xiaotian Dou and Danny Sleator and Alan Frieze and David Miller},
journal= {arXiv preprint arXiv:1510.03247},
year = {2015}
}
Comments
about authorship naming problem, will fix soon