1 paper
Tomer Ezra, Tamar Garbuz
We study the classic single-choice prophet secretary problem through a resource augmentation lens. Our goal is to bound the (1−ε)-competition complexity for different classes of…