Neutral Redistricting Using a Multi-Level Weighted Graph Partitioning Algorithm
In the 1960s, Nobel Prize winning economist William Vickrey posited that computers would soon be able to draw legislative districts without bias in an automatic and impersonal way. We have created a new algorithm for redistricting that shows no indication of bias that is also efficient enough to handle the largest jurisdictions analysts might examine.
Inventor(s): Daniel Magleby, Daniel Mosesson
Keywords(s): #SUNYresearch, Technology
Category(s): Technology Classifications > Social Sciences, Campus > Binghamton University