Addressing bias in online selection with limited budget of comparisons

03/16/2023
by   Ziyad Benomar, et al.
0

Consider a hiring process with candidates coming from different universities. It is easy to order candidates who have the same background, yet it can be challenging to compare them otherwise. The latter case requires additional costly assessments and can result in sub-optimal hiring decisions. Given an assigned budget, what would be an optimal strategy to select the most qualified candidate? We model the above problem by introducing a new variant of the secretary problem in which sequentially observed candidates are split into two distinct groups. For each new candidate, the decision maker observes its rank among already seen candidates from the same group and can access its rank among all observed candidates at some fixed cost. To tackle this new problem, we introduce and study the family of Dynamic Double Threshold (DDT) algorithms. We show that, with well-chosen parameters, their success probability converges rapidly to 1/e as the budget grows, recovering the optimal success probability from the usual secretary problem. Finally, focusing on the class of memory-less algorithms, we propose an optimal algorithm in the non-asymptotic regime and show that it belongs to the DDT family when the number of candidates is large.

READ FULL TEXT
research
09/18/2019

How to Hire Secretaries with Stochastic Departures

We study a generalization of the secretary problem, where decisions do n...
research
11/16/2020

Finding the Second-Best Candidate under the Mallows Model

The well-known secretary problem in sequential analysis and optimal stop...
research
09/16/2019

An Asymptotic Analysis on Generalized Secretary Problem

As a famous result, the “37% Law” for Secretary Problem has widely influ...
research
02/12/2020

Optimal Multiple Stopping Rule for Warm-Starting Sequential Selection

In this paper we present the Warm-starting Dynamic Thresholding algorith...
research
09/19/2018

The Multi-Round Sequential Selection Problem

In the Sequential Selection Problem (SSP), immediate and irrevocable dec...
research
12/01/2021

Robust Online Selection with Uncertain Offer Acceptance

Online advertising has motivated interest in online selection problems. ...
research
05/16/2023

Balancing Risk and Reward: An Automated Phased Release Strategy

Phased releases are a common strategy in the technology industry for gra...

Please sign up or login with your details

Forgot password? Click here to reset