让下一篇重要论文，不再错过。

We study variants of the secretary problem, where $N$, the number of candidates, is a random variable with distribution $\mathbf p$. The decision maker, given prior distributional information about $\mathbf p$, wants to maximize the probability of success -- picking the largest number among the $N$ candidates -- using only the sequentially revealed relative ranks of the candidates. When $\mathbf p$ is fully known (full information setting), we show that single-threshold type of strategies can achieve $1/e$-approximation to the optimal probability of success among all possible strategies. In the sampling setting, we give an algorithm that finds a strategy with additive suboptimality at most $ε$ and provide its sample-complexity guarantee. We also give a sampling lower bound; for small $ε$, the upper and lower bounds match up to a logarithmic factor in $1/ε$.