atlas

Research map / Learning theory and algorithms / Fairness

The Panel Complexity of Sortition: Is 12 Angry Men Enough?

NeurIPS 2026 · Learning theory and algorithms › Fairness · approach: Causal and policy fairness in decisions · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Defines Wasserstein-based representative panels and derives panel-size bounds (panel complexity) for participatory budgeting and facility location under uniform sortition, with matching lower bounds.

Problem

How large must a uniformly random sortition panel be so that its decisions in social choice settings (participatory budgeting, facility location) yield welfare, core fairness, or outlier guarantees for the whole population?

Approach

Measures panel representativeness via Wasserstein-1 distance between panel and population feature distributions, giving a panel size independent of population size and of the number of features; combines this with sampling-without-replacement reductions, concentration, and camouflaged-population lower bounds.

Key results

Surprising findings

Limitations

Experimental setup

Metrics: panel size bound expected social cost approximation core approximation parameters

Baselines: random dictatorship distance-minimizing panel selection

Builds on: Wasserstein distance (optimal transport) Hoeffding's inequality for sampling without replacement McDiarmid-style inequality for sampling without replacement

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy