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 条
  • [21] Submodular Secretary Problem and Extensions
    Bateni, Mohammadhossein
    Hajiaghayi, Mohammadtaghi
    Zadimoghaddam, Morteza
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (04)
  • [22] On Variants of the Matroid Secretary Problem
    Shayan Oveis Gharan
    Jan Vondrák
    Algorithmica, 2013, 67 : 472 - 497
  • [23] Learning in the Repeated Secretary Problem
    Goldstein, Daniel G.
    McAfee, R. Preston
    Suri, Siddharth
    Wright, James R.
    EC'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2017, : 541 - 541
  • [24] THE SECRETARY PROBLEM IN A COMPETITIVE SITUATION
    FUSHIMI, M
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1981, 24 (04) : 350 - 359
  • [25] THE SECRETARY PROBLEM WITH A CALL OPTION
    ROSE, JS
    OPERATIONS RESEARCH LETTERS, 1984, 3 (05) : 237 - 241
  • [26] THE INFINITE SECRETARY PROBLEM WITH RECALL
    ROCHA, AL
    ANNALS OF PROBABILITY, 1993, 21 (02): : 898 - 916
  • [27] The Public University Secretary Problem
    Moseley, Benjamin
    Newman, Heather
    Pruhs, Kirk
    2024 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2024, : 100 - 106
  • [28] THE OLA POLICY FOR OPTIMAL STOPPING FOR A GENERALIZED SECRETARY PROBLEM WITH 3 STOPS AND LINEAR TRAVEL COST
    MAJUMDAR, AAK
    MATIN, MA
    SANKHYA-THE INDIAN JOURNAL OF STATISTICS SERIES B, 1991, 53 : 409 - 422
  • [29] Exact results for a secretary problem
    Quine, MP
    Law, JS
    JOURNAL OF APPLIED PROBABILITY, 1996, 33 (03) : 630 - 639
  • [30] The Secretary Problem with Independent Sampling
    Correa, Jose
    Cristi, Andres
    Feuilloley, Laurent
    Oosterwijk, Tim
    Tsigonias-Dimitriadis, Alexandros
    MANAGEMENT SCIENCE, 2024,
12345