paper-with-me

Papers

Merit-Based Sortition in Decentralized Systems

2024-11-11 · J. M. Diederik Kruijssen, Renata Valieva, Kenneth Peluso, Nicholas Emmons, Steven N. Longmore

In decentralized systems, it is often necessary to select an 'active' subset of participants from the total participant pool, with the goal of satisfying computational limitations or optimizing resource efficiency. This selection can sometimes be made at random, mirroring the sortition practice invented in classical antiquity aimed at achieving a high degree of statistical representativeness. However, the recent emergence of specialized decentralized networks that solve concrete coordination problems and are characterized by measurable success metrics often requires prioritizing performance optimization over representativeness. We introduce a simple algorithm for 'merit-based sortition', in which the quality of each participant influences its probability of being drafted into the active set, while simultaneously retaining representativeness by allowing inactive participants an infinite number of chances to be drafted into the active set with non-zero probability. Using a suite of numerical experiments, we demonstrate that our algorithm boosts the quality metric describing the performance of the active set by $>2$ times the intrinsic stochasticity. This implies that merit-based sortition ensures a statistically significant performance boost to the drafted, 'active' set, while retaining the property of classical, random sortition that it enables upward mobility from a much larger 'inactive' set. This way, merit-based sortition fulfils a key requirement for decentralized systems in need of performance optimization.

📄 PDF Abstract BibTeX arXiv:2411.07302

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Democratic Preference Alignment via Sortition-Weighted RLHF

2026-02-04 · Suvadip Sana, Jinzhou Wu, Martin T. Wells arxiv

Whose values should AI systems learn? Preference based alignment methods like RLHF derive their training signal from human raters, yet these rater pools are typically convenience samples that systematically over represen…

Fair, Manipulation-Robust, and Transparent Sortition

2024-06-21 · Carmel Baharav, Bailey Flanigan

Sortition, the random selection of political representatives, is increasingly being used around the world to choose participants of deliberative processes like Citizens' Assemblies. Motivated by sortition's practical imp…

Meritocracy and Its Discontents: Long-run Effects of Repeated School Admission Reforms

2024-02-06 · Chiaki Moriguchi, Yusuke Narita, Mari Tanaka

What happens if selective colleges change their admission policies? We study this question by analyzing the world's first implementation of nationally centralized meritocratic admissions in the early twentieth century. W…

Fair Sortition Made Transparent

2021-12-01 · NeurIPS 2021 12 · Bailey Flanigan, Gregory Kehne, Ariel D. Procaccia

Sortition is an age-old democratic paradigm, widely manifested today through the random selection of citizens' assemblies. Recently-deployed algorithms select assemblies \textit{maximally fairly}, meaning that subject to…

Fairness

Representative Committees of Peers

2020-06-14 · Reshef Meir, Fedor Sandomirskiy, Moshe Tennenholtz

A population of voters must elect representatives among themselves to decide on a sequence of possibly unforeseen binary issues. Voters care only about the final decision, not the elected representatives. The disutility …