The following pages link to Fair redistricting is hard (Q2272397):
Displaying 12 items.
- A fair division solution to the problem of redistricting (Q733796) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Optimal redistricting under geographical constraints: why ``pack and crack'' does not work (Q1046263) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- A computational approach to unbiased districting (Q2389779) (← links)
- Metropolized Multiscale Forest Recombination for Redistricting (Q5022764) (← links)
- Redistricting algorithms (Q5050043) (← links)
- Geometry, inference, complexity, and democracy (Q5146571) (← links)
- A fast sorting algorithm to redistricting election model (Q5320504) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Priced gerrymandering (Q6093576) (← links)