A Note on the Expected Number of Interviews When Talent is Uniformly Distributed

10/26/2018
by   Simon Demers, et al.
0

Optimal stopping problems give rise to random distributions describing how many applicants the decision-maker will observe or interview before choosing one, a quantity sometimes referred to as the optimal stopping time. Despite the fact that is has important practical implications, this quantity is not widely studied. This short research note considers how many interviews are expected to be conducted when a decision-maker has to choose a candidate from a pool of sequential applicants with uniformly distributed talent and no recall, in the vein of previously studied Cayley-Moser and Secretary Problems. In terms of theoretical contribution, we derive algebraically the expected number of interviews when the decision-maker can only assess candidates using a rank-based indicator. In terms of empirical contribution, we show how the expected number of interviews relates to the size of the applicant pool when payoff values are observable. Finally, we present a new conjecture around the median number of interviews that will be conducted in the full-information setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2022

Individual Fairness in Prophet Inequalities

Prophet inequalities are performance guarantees for online algorithms (a...
research
10/27/2021

A sequential estimation problem with control and discretionary stopping

We show that "full-bang" control is optimal in a problem that combines f...
research
10/26/2018

Packing Returning Secretaries

We study online secretary problems with returns in combinatorial packing...
research
02/14/2022

Online Approval Committee Elections

Assume k candidates need to be selected. The candidates appear over time...
research
07/15/2021

Optimal Stopping Methodology for the Secretary Problem with Random Queries

Candidates arrive sequentially for an interview process which results in...
research
10/27/2020

A Note on Multigrid Preconditioning for Fractional PDE-Constrained Optimization Problems

In this note we present a multigrid preconditioning method for solving q...
research
03/21/2018

Mislearning from Censored Data: Gambler's Fallacy in a Search Problem

In the context of a sequential search problem, I explore large-generatio...

Please sign up or login with your details

Forgot password? Click here to reset