多个交易所的持续时间问题
The duration problem with multiple exchanges
摘要:
我们对待一个版本的多项选择的秘书问题称为多项选择的持续时间问题,其目标是最大限度地提高拥有相对最好的对象的时间。证明了对于$m$--选择持续时间问题,存在一个序列(s1,s2,.,sm),使得只要还有k个选择要做,则最优策略立即选择相对最佳的对象,如果它在时间$s_k$($1\leq k\leq m$)处或之后出现。我们还展示了持续时间问题和经典的最佳选择秘书问题之间的等价性。当目标数趋于无穷大时,给出了计算临界数的一个简单的递推公式。对涉及购置或重置成本的模型进行了扩展。
英文摘要:
We treat a version of the multiple-choice secretary problem called the multiple-choice duration problem, in which the objective is to maximize the time of possession of relatively best objects. It is shown that, for the $m$--choice duration problem, there exists a sequence (s1,s2,...,sm) of critical numbers such that, whenever there remain k choices yet to be made, then the optimal strategy immediately selects a relatively best object if it appears at or after time $s_k$ ($1\leq k\leq m$). We also exhibit an equivalence between the duration problem and the classical best-choice secretary problem. A simple recursive formula is given for calculating the critical numbers when the number of objects tends to infinity. Extensions are made to models involving an acquisition or replacement cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。