Fair and Optimal Cohort Selection for Linear Utilities [article]

Konstantina Bairaktari, Huy Le Nguyen, Jonathan Ullman
2022 arXiv   pre-print
The rise of algorithmic decision-making has created an explosion of research around the fairness of those algorithms. While there are many compelling notions of individual fairness, beginning with the work of Dwork et al., these notions typically do not satisfy desirable composition properties. To this end, Dwork and Ilvento introduced the fair cohort selection problem, which captures a specific application where a single fair classifier is composed with itself to pick a group of candidates of
more » ... ize exactly k. In this work we introduce a specific instance of cohort selection where the goal is to choose a cohort maximizing a linear utility function. We give approximately optimal polynomial-time algorithms for this problem in both an offline setting where the entire fair classifier is given at once, or an online setting where candidates arrive one at a time and are classified as they arrive.
arXiv:2102.07684v3 fatcat:pzlowt3uebek5og7hzr2fe2su4