Cargando…
Gerrymandering and computational redistricting
Partisan gerrymandering poses a threat to democracy. Moreover, the complexity of the districting task may exceed human capacities. One potential solution is using computational models to automate the districting process by optimizing objective and open criteria, such as how spatially compact distric...
Autores principales: | Guest, Olivia, Kanayet, Frank J., Love, Bradley C. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Singapore
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6777516/ https://www.ncbi.nlm.nih.gov/pubmed/31633071 http://dx.doi.org/10.1007/s42001-019-00053-9 |
Ejemplares similares
-
Simulated redistricting plans for the analysis and evaluation of redistricting in the United States
por: McCartan, Cory, et al.
Publicado: (2022) -
Optimality and fairness of partisan gerrymandering
por: Lagarde, Antoine, et al.
Publicado: (2021) -
Maximizing gerrymandering through ising model optimization
por: Okamoto, Yasuharu
Publicado: (2021) -
Redistricting a manual for analysts, practitioners, and citizens
por: Morrison, Peter A, et al.
Publicado: (2019) -
Seed-Fill-Shift-Repair: A redistricting heuristic for civic deliberation
por: Haas, Christian, et al.
Publicado: (2020)