Sequential Cohort Selection
By: Hortence Phalonne Nana, Christos Dimitrakakis
Potential Business Impact:
Helps colleges pick students fairly, even before they apply.
We study the problem of fair cohort selection from an unknown population, with a focus on university admissions. We start with the one-shot setting, where the admission policy must be fixed in advance and remain transparent, before observing the actual applicant pool. In contrast, the sequential setting allows the policy to be updated across stages as new applicant data becomes available. This is achieved by optimizing admission policies using a population model, trained on data from previous admission cycles. We also study the fairness properties of the resulting policies in the one-shot setting, including meritocracy and group parity.
Similar Papers
Online Learning of Optimal Sequential Testing Policies
Machine Learning (CS)
Helps pick the best tests for people faster.
Fixed Points and Stochastic Meritocracies: A Long-Term Perspective
Computers and Society
Makes fair programs stay fair over time.
Online Multi-Class Selection with Group Fairness Guarantee
Machine Learning (CS)
Fairly shares limited stuff with everyone.