Timezone: »
Sortition is a political system in which decisions are made by panels of randomly selected citizens. The process for selecting a sortition panel is traditionally thought of as uniform sampling without replacement, which has strong fairness properties. In practice, however, sampling without replacement is not possible since only a fraction of agents is willing to participate in a panel when invited, and different demographic groups participate at different rates. In order to still produce panels whose composition resembles that of the population, we develop a sampling algorithm that restores close-to-equal representation probabilities for all agents while satisfying meaningful demographic quotas. As part of its input, our algorithm requires probabilities indicating how likely each volunteer in the pool was to participate. Since these participation probabilities are not directly observable, we show how to learn them, and demonstrate our approach using data on a real sortition panel combined with information on the general population in the form of publicly available survey data.
Author Information
Bailey Flanigan (Carnegie Mellon University)
Paul Gölz (Carnegie Mellon University)
Anupam Gupta (Carnegie Mellon University)
Ariel Procaccia (Harvard University)
More from the Same Authors
-
2023 Poster: Strategyproof Voting under Correlated Beliefs »
Daniel Halpern · Rachel Li · Ariel Procaccia -
2023 Poster: The Distortion of Binomial Voting Defies Expectation »
Yannai A. Gonczarowski · Gregory Kehne · Ariel Procaccia · Benjamin Schiffer · Shirley Zhang -
2022 Spotlight: Learning from a Sample in Online Algorithms »
C.J. Argue · Alan Frieze · Anupam Gupta · Christopher Seiler -
2022 Poster: Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions »
Anupam Gupta · Debmalya Panigrahi · Bernardo Subercaseaux · Kevin Sun -
2022 Poster: Learning from a Sample in Online Algorithms »
C.J. Argue · Alan Frieze · Anupam Gupta · Christopher Seiler -
2021 : Invited Talk: Ariel Procaccia (Harvard University) on Democracy and the Pursuit of Randomness »
Ariel Procaccia -
2020 Poster: Explainable Voting »
Dominik Peters · Ariel Procaccia · Alexandros Psomas · Zixin Zhou -
2020 Poster: Axioms for Learning from Pairwise Comparisons »
Ritesh Noothigattu · Dominik Peters · Ariel Procaccia -
2019 Poster: Envy-Free Classification »
Maria-Florina Balcan · Travis Dick · Ritesh Noothigattu · Ariel Procaccia -
2019 Poster: Paradoxes in Fair Machine Learning »
Paul Gölz · Anson Kahng · Ariel Procaccia -
2019 Spotlight: Paradoxes in Fair Machine Learning »
Paul Gölz · Anson Kahng · Ariel Procaccia -
2019 Poster: Efficient and Thrifty Voting by Any Means Necessary »
Debmalya Mandal · Ariel Procaccia · Nisarg Shah · David Woodruff -
2007 Spotlight: Selecting Observations against Adversarial Objectives »
Andreas Krause · H. Brendan McMahan · Carlos Guestrin · Anupam Gupta -
2007 Poster: Selecting Observations against Adversarial Objectives »
Andreas Krause · H. Brendan McMahan · Carlos Guestrin · Anupam Gupta