2024/10/09 by Davin Choo, Chun Kai Ling, Choo, Davin +1
Computer Science · Engineering · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Mobile Agent-Based Network Management #Optimization and Search Problems #Satellite Communication Systems
paper · pdf · doi:10.48550/arxiv.2410.06583
openalex publication_date 2024/10/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the secretary problem through the lens of learning-augmented algorithms. As it is known that the best possible expected competitive ratio is 1/e in the classic setting without predictions, a natural goal is to design algorithms that are 1-consistent and 1/e-robust. Unfortunately, [FY24] provided hardness constructions showing that such a goal is not attainable when the candidates' true values are allowed to scale with n. Here, we provide a simple and explicit alternative hardness construction showing that such a goal is not achievable even when the candidates' true values are constants that do not scale with n.