Meritocratic Fairness for Cross-Population Selection

2017-08-01 · ICML 2017 8 · Michael Kearns, Aaron Roth, Zhiwei Steven Wu

We consider the problem of selecting a strong pool of individuals from several populations with incomparable skills (e.g. soccer players, mathematicians, and singers) in a fair manner. The quality of an individual is defined to be their relative rank (by cumulative distribution value) within their own population, which permits cross-population comparisons. We study algorithms which attempt to select the highest quality subset despite the fact that true CDF values are not known, and can only be estimated from the finite pool of candidates. Specifically, we quantify the regret in quality imposed by “meritocratic” notions of fairness, which require that individuals are selected with probability that is monotonically increasing in their true quality. We give algorithms with provable fairness and regret guarantees, as well as lower bounds, and provide empirical results which suggest that our algorithms perform better than the theory suggests. We extend our results to a sequential batch setting, in which an algorithm must repeatedly select subsets of individuals from new pools of applicants, but has the benefit of being able to compare them to the accumulated data from previous rounds.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Fairness

Meritocratic Fairness via $K$-Shapley Values in Budgeted Combinatorial Bandits with Full-Bandit Feedback

2026-05-01 · Shradha Sharma, Swapnil Dhamal, Shweta Jain arxiv

We study meritocratic fairness in budgeted combinatorial multi-armed bandits with full-bandit feedback, where a learner selects at most $K$ arms per time step and observes only the noisy aggregate reward of the selected …

Multi-Armed Bandits Federated Learning

Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits

2024-02-08 · Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Swapnil Dhamal 외

Existing approaches to fairness in stochastic multi-armed bandits (MAB) primarily focus on exposure guarantee to individual arms. When arms are naturally grouped by certain attribute(s), we propose Bi-Level Fairness, whi…

Attribute Exposure Fairness Fairness Multi-Armed Bandits

Fair Algorithms for Infinite and Contextual Bandits

2016-10-29 · Matthew Joseph, Michael Kearns, Jamie Morgenstern, Seth Neel 외

We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performa…

Fairness Multi-Armed Bandits

Selection of the Best Policy under Fairness Constraints for Subpopulations

2026-05-11 · Tingyu Zhu, Yuhang Wu, Zeyu Zheng arxiv

Many high-stakes decisions in health care, public policy, and clinical development require committing to a single policy that will be applied uniformly across a heterogeneous population. Regulatory and fairness standards…

Strategic Costs of Perceived Bias in Fair Selection

2025-10-23 · L. Elisa Celis, Lingxiao Huang, Milind Sohoni, Nisheeth K. Vishnoi arxiv

Meritocratic systems, from admissions to hiring, aim to impartially reward skill and effort. Yet persistent disparities across race, gender, and class challenge this ideal. Some attribute these gaps to structural inequal…