We introduce the problem of query-based selection of the optimal candidate in rank-ordered lists generated by the Mallows model. In this setting, one is presented with a list of candidates drawn according to a Gaussian-like distribution for permutations and the goal is to identify the highest ranked candidate through a sequential interview process that does not allow rejected candidates to be revisited. The new modeling assumption consists in being able to query a Genie at the time a selection is to be made. The query provides an answer indicating if the candidate in question is the highest-ranked or not. If the Genie confirms the query, the selection process terminates. Otherwise, the sequential examinations continue until a new potentially optimal candidate is identified. Our results include optimal interview strategies for a bounded number of queries that can be exactly determined through numerical evaluations as well as the expected number of interviews until the optimal candidate is identified or the interview process completed. Although the problem exhibits similarities with the Dowry problem with multiple choices of Gilbert and Mosteller, the proposed Genie-based model substantially differs from it as it allows for early stopping and addresses nonuniform candidate interview distributions.
翻译:我们引入了在Mallows 模式生成的按级排列名单中选择最佳候选人的询问问题。 在这种背景下,我们提出了一个候选人名单,根据类似Gaussian式的分布分布进行排列,目的是通过顺序面试程序确定排名最高的候选人,不允许对被否决的候选人重新进行面试;新的模型假设是,在进行甄选时能够询问一位Genie。查询提供了一个答案,说明有关候选人是否是排名最高的候选人。如果Genie确认询问,甄选程序将终止。否则,连续考试将持续到找到一个新的可能最理想的候选人为止。我们的结果包括,通过数字评价以及预期的面试次数来准确确定,直到找到最佳候选人或完成面试过程。尽管问题与Dowry问题有相似之处,有吉尔伯特和莫斯勒的多重选择,但拟议的Genie模式与它有很大不同,因为它允许及早停止和处理非统一的候选人面试分配。