EN

Article

Fair algorithms for selecting citizens' assemblies

Bailey Flanigan; Paul Gölz; Anupam Gupta; Brett Hennig; Ariel D. Procaccia · Nature · 2021

Open publisher page ↗

Type: Article
Author: Bailey Flanigan; Paul Gölz; Anupam Gupta; Brett Hennig; Ariel D. Procaccia
Identifier: DOI 10.1038/s41586-021-03788-6
Accessed: 2026-09-01
Reliability notes: Vol. 596, pp. 548-552.

Claims citing this source

2 claims

EstablishedFlanigan and colleagues show that differing participation rates across groups create a tension between representative lot-selected panels and equal chances of selection; their algorithm, used to select more than 40 citizens' assemblies by 2021, makes selection probabilities as equal as possible subject to quotas.EstablishedFlanigan 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.