A short note about the learning-augmented secretary problem

Davin Choo, Chun Kai Ling

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 settin…