2025/06/02 by Angelos Assos, Carmel Baharav, Assos, Angelos +5 · 1 citation
Computer Science · Economics, Econometrics and Finance · Social Sciences · #Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #Ethics and Social Impacts of AI #FOS: Computer and information sciences #Game Theory and Voting Systems #Machine Learning (cs.LG) #Mobile Crowdsensing and Crowdsourcing
paper · pdf · doi:10.48550/arxiv.2506.15716
openalex publication_date 2025/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but participant dropout often leads to an unbalanced composition. In practice, dropouts are replaced by preselected alternates, but existing methods do not address how to choose these alternates. To address this gap, we introduce an optimization framework for alternate selection. Our algorithmic approach, which leverages learning-theoretic machinery, estimates dropout probabilities using historical data and selects alternates to minimize expected misrepresentation. Our theoretical bounds provide guarantees on sample complexity (with implications for computational efficiency) and on loss due to dropout probability mis-estimation. Empirical evaluation using real-world data demonstrates that, compared to the status quo, our method significantly improves representation while requiring fewer alternates.