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 条
  • [41] SECRETARY PROBLEM WITH DOUBLE CHOICES
    TAMAKI, M
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1979, 22 (04) : 257 - 265
  • [42] A SECRETARY PROBLEM ON FUZZY SETS
    LI XIAOJIE AND JIN ZHIMING(Department of Mathematics
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 1995, (03) : 325 - 336
  • [43] The Secretary Problem with a Choice Function
    Kawase, Yasushi
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 129 - 139
  • [44] A knapsack secretary problem with applications
    Babaioff, Moshe
    Immorlica, Nicole
    Kempe, David
    Kleinberg, Robert
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 16 - 28
  • [45] Bilateral approach to the secretary problem
    Ramsey, D
    Szajowski, K
    ADVANCES IN DYNAMIC GAMES: APPLICATIONS TO ECONOMICS, FINANCE, OPTIMIZATION, AND STOCHASTIC CONTROL, 2005, 7 : 271 - 284
  • [46] SECRETARY PROBLEM WITH FINITE MEMORY
    SMITH, MH
    DEELY, JJ
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1975, 70 (350) : 357 - 361
  • [47] On Variants of the Matroid Secretary Problem
    Gharan, Shayan Oveis
    Vondrak, Jan
    ALGORITHMICA, 2013, 67 (04) : 472 - 497
  • [48] On Variants of the Matroid Secretary Problem
    Gharan, Shayan Oveis
    Vondrak, Jan
    ALGORITHMS - ESA 2011, 2011, 6942 : 335 - 346
  • [49] Exact results for a secretary problem
    Quine, M. P.
    Law, J. S.
    Journal of Applied Probability, 33 (03):
  • [50] The Secretary Problem with Reservation Costs
    Burjons, Elisabet
    Gehnen, Matthias
    Lotze, Henri
    Mock, Daniel
    Rossmanith, Peter
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 553 - 564
12345