DeepAI AI Chat
Log In Sign Up

An Asymptotic Analysis on Generalized Secretary Problem

09/16/2019
by   Zishuo Zhao, et al.
0

As a famous result, the “37% Law” for Secretary Problem has widely influenced peoples' perception on online decision strategies about choice. However, using this strategy, too many attractive candidates may be rejected in the first 37%, and in practice people also tend to stop earlier<cit.>. In this paper, we argued that in most cases, the best-only optimization does not obtain an optimal outcome, while the optimal cutoff should be O(√(n)). And we also showed that in some strict objective that only cares several best candidates, Θ(n) skips are still needed.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/16/2020

Finding the Second-Best Candidate under the Mallows Model

The well-known secretary problem in sequential analysis and optimal stop...
03/16/2023

Addressing bias in online selection with limited budget of comparisons

Consider a hiring process with candidates coming from different universi...
06/19/2019

Who is in Your Top Three? Optimizing Learning in Elections with Many Candidates

Elections and opinion polls often have many candidates, with the aim to ...
12/04/2020

On the best-choice prophet secretary problem

We study a variant of the secretary problem where candidates come from i...
05/07/2019

Hiring Under Uncertainty

In this paper we introduce the hiring under uncertainty problem to model...
12/01/2021

Robust Online Selection with Uncertain Offer Acceptance

Online advertising has motivated interest in online selection problems. ...