arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.00567math.PR
收藏

有偏到达次序服从Mallow分布的秘书问题

The secretary problem with biased arrival order via a Mallows distribution

Ross G. Pinsky

摘要:

我们解决了秘书问题的情况下,排名项目到达统计偏差的顺序,而不是在均匀随机顺序。偏差由具有参数$q\in(0,1)$的Mallow分布给出,因此排名较高的项目倾向于较晚到达,排名较低的项目倾向于较早到达。在经典问题中,渐近最优策略是拒绝第一个$M_n^*$项,其中$M_n^*\sim\frac ne$,然后选择排名高于第一个$M_n^*$项中任何一个的第一个项(如果存在这样的项)。这产生$\frac1e$作为成功的限制概率。具有参数$q=1$的Mallow分布是均匀分布。对于$q_n=1-\frac cn$和$c>0$方案,在弱偏倚的情况下,最佳策略是使用$M_n^*\sim n\Big(\frac1c\log\big(1+\frac{e^c-1}e\big)\Big)$,成功概率最小的是$\frac1e$。对于$q_n=1-\frac c{n^α}$方案,使用$c>0$和$α\in(0,1)$,在中度偏倚的情况下,最佳策略使用$n-M_n\sim\frac{n^α}c$,成功概率为$\frac1e$。对于固定的$q\in(0,1)$,强偏差的情况下,最佳策略发生在$M_n^*=n-L$,其中$\frac{L-1}L<q\le \frac L{L+1}$,成功的有限概率是$(1-q)q^{L-1}L>\frac1e$。

英文摘要:

We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is given by a Mallows distribution with parameter $q\in(0,1)$, so that higher ranked items tend to arrive later and lower ranked items tend to arrive sooner. In the classical problem, the asymptotically optimal strategy is to reject the first $M_n^*$ items, where $M_n^*\sim\frac ne$, and then to select the first item ranked higher than any of the first $M_n^*$ items (if such an item exists). This yields $\frac1e$ as the limiting probability of success. The Mallows distribution with parameter $q=1$ is the uniform distribution. For the regime $q_n=1-\frac cn$, with $c>0$, the case of weak bias, the optimal strategy occurs with $M_n^*\sim n\Big(\frac1c\log\big(1+\frac{e^c-1}e\big)\Big)$, with the limiting probability of success being $\frac1e$. For the regime $q_n=1-\frac c{n^α}$, with $c>0$ and $α\in(0,1)$, the case of moderate bias, the optimal strategy occurs with $n-M_n\sim\frac{n^α}c$, with the limiting probability of success being $\frac1e$. For fixed $q\in(0,1)$, the case of strong bias, the optimal strategy occurs with $M_n^*=n-L$ where $\frac{L-1}L<q\le \frac L{L+1}$, with limiting probability of success being $(1-q)q^{L-1}L>\frac1e$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑