Optimal thresholds are derived for a returning secretary problem with reappearance probability p, while relaxing success to any top-three candidate raises success probability and moves the stopping threshold earlier under the classical strategy.
Online auctions and generalized secretary problems.ACM SIGecom Exchanges, 7(2):1–11, June 2008
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Some variations of the secretary problem
Optimal thresholds are derived for a returning secretary problem with reappearance probability p, while relaxing success to any top-three candidate raises success probability and moves the stopping threshold earlier under the classical strategy.