Shelf life of candidates in the generalized secretary problem

被引：3
|
作者：
Szajowski, Krzysztof [1 ]
Tamaki, Mitsushi [2 ]
机构：
[1] Wroclaw Univ Technol, Fac Math, Wybrzeie Wyspianskiego 27, PL-50370 Wroclaw, Poland
[2] Aichi Univ, Dept Business Adm, Nagoya Campus,Hiraike 4-60-6, Nagoya, Aichi 4538777, Japan
来源：
OPERATIONS RESEARCH LETTERS | 2016年 / 44卷 / 04期
关键词：
Optimal stopping; Relative ranks; Best-choice problem; Duration problem; Dynamic programming; FULL-INFORMATION; CHOICE PROBLEMS; DURATION; MAXIMUM; NUMBER; 2ND;
D O I：
10.1016/j.orl.2016.05.002
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The study presents a version of the secretary problem called the duration problem in which the objective is to maximize the time of possession of the relatively best or the second best objects. It is shown that in this duration problem there are threshold numbers such that the optimal strategy is determined by them. When the number of objects tends to infinity the thresholds values are [1.0.120381M] and [19.417188N], respectively, and the asymptotic mean time of shelf life is 0.403827N. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码：498 / 502
页数：5
相关论文
共 50 条
12345