1 citations · 1 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2024
The Competition Complexity of Prophet Inequalities
Johannes Brustle, José Correa, Paul Dütting +3
We study the classic single-choice prophet inequality problem through a resource augmentation lens. Our goal is to bound the -competition complexity of different t…
cs.GT2023★ 1 cited
Prophet Secretary Against the Online Optimal
Paul Dütting, Evangelia Gergatsouli, Rojin Rezvan +2
We study the prophet secretary problem, a well-studied variant of the classic prophet inequality, where values are drawn from independent known distributions but arrive in uniforml…