Fair algorithms for selecting citizens' assemblies
Bailey Flanigan,Paul Gölz,Anupam Gupta,Brett Hennig,Ariel D. Procaccia — Fair algorithms for selecting citizens' assemblies (2021)Bailey Flanigan; Paul Gölz; Anupam Gupta; Brett Hennig; Ariel D. Procaccia · 2021 · Article · Deployable selection algorithmEstablishedSource attached · not independently reviewedCLM-0825 · as of 2026-10-30 · about: Sortition / citizens' assembly · Author: Polity Atlas editorial team
“Flanigan and colleagues (2021) showed that the panel-selection algorithm previously used by the Sortition Foundation gave some volunteers a near-zero chance of selection; their LEXIMIN algorithm, which maximises the lowest selection probability subject to quotas, had been used for more than 40 panels by June 2021.”
Context. Fairer selection among volunteers does not correct self-selection at the invitation stage.
Evidence that supports
1Evidence that contradicts
0No counter-evidence recorded.
Status history
No earlier revisions.
Disputes
No disputes have been filed.