Addressing Bias in Online Selection with Limited Budget of Comparisons
arXiv:2303.09205
Abstract
Consider a hiring process with candidates coming from different universities. It is easy to order candidates with the same background, yet it can be challenging to compare them otherwise. The latter case requires additional costly assessments, leading to a potentially high total cost for the hiring organization. Given an assigned budget, what would be an optimal strategy to select the most qualified candidate? We model the above problem as a multicolor secretary problem, allowing comparisons between candidates from distinct groups at a fixed cost. Our study explores how the allocated budget enhances the success probability of online selection algorithms.
arXiv commentAccepted as a conference paper at NeurIPS 2024
References in corpus (6)
- Mitigating Bias in Algorithmic Hiring: Evaluating Claims and Practices
- Don't let Ricci v. DeStefano Hold You Back: A Bias-Aware Legal Solution to the Hiring Paradox
- Parsimonious Learning-Augmented Caching
- Algorithms for Caching and MTS with reduced number of predictions
- Non-clairvoyant Scheduling with Partial Predictions
- Lookback Prophet Inequalities