Algorithms for the two-sided Googol game achieve 0.45292 probability and 0.63518 expectation ratios for selecting the max hidden value and improve sample-based prophet secretary bounds.
A survey of prophet inequalities in optimal stopping theory.Contemporary Mathematics 125, 191–207
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
Algorithms for the two-sided Googol game achieve 0.45292 probability and 0.63518 expectation ratios for selecting the max hidden value and improve sample-based prophet secretary bounds.