THE CONFERENCE
FOR AUTHORS
FOR PARTICIPANTS

Timezone: »

 
Talk
Meritocratic Fairness for Cross-Population Selection
Michael Kearns · Aaron Roth · Steven Wu

Mon Aug 07 06:06 PM -- 06:24 PM (PDT) @ C4.8
in Learning theory 1 »

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]  [ ss Summary/Notes]  [ Video] 

Author Information

Michael Kearns (University of Pennsylvania)
Aaron Roth (University of Pennsylvania)
Steven Wu (Microsoft Research & U. of Pennsylvania)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors