2019/09/16 by Zishuo Zhao, Zhao, Zishuo
Computer Science · Decision Sciences · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.1909.07457
openalex publication_date 2019/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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\citeBeardenearly. 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.