DeepAI AI Chat
Log In Sign Up

An Asymptotic Analysis on Generalized Secretary Problem

by   Zishuo Zhao, et al.

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.


page 1

page 2

page 3

page 4


Finding the Second-Best Candidate under the Mallows Model

The well-known secretary problem in sequential analysis and optimal stop...

Addressing bias in online selection with limited budget of comparisons

Consider a hiring process with candidates coming from different universi...

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 ...

On the best-choice prophet secretary problem

We study a variant of the secretary problem where candidates come from i...

Hiring Under Uncertainty

In this paper we introduce the hiring under uncertainty problem to model...

Robust Online Selection with Uncertain Offer Acceptance

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