The (1-epsilon)-competition complexity of prophet secretary is Theta(ln(1/epsilon)) for single-threshold algorithms, Theta(ln(1/epsilon)/ln ln(1/epsilon)) for time-based and activation-based algorithms, and Theta(sqrt(ln(1/epsilon))) for fully adaptive algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Competition Complexity of Prophet Secretary
The (1-epsilon)-competition complexity of prophet secretary is Theta(ln(1/epsilon)) for single-threshold algorithms, Theta(ln(1/epsilon)/ln ln(1/epsilon)) for time-based and activation-based algorithms, and Theta(sqrt(ln(1/epsilon))) for fully adaptive algorithms.