A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the so-called secretary problem, in which an offer may be declined by each applicant with a fixed known probability q (= 1 - p, 0 ≤ q < 1) and the number of offering chances are at most m (≥ 1). The optimal strategy of this problem is derived and some asymptotic results are presented. Furthermore we briefly consider the case in which the acceptance probability depends on the number m of offering chances.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Tamaki Mitsushi

  Aichi University

• Ano Katsunori

  Department of Information Systems and Quantitative Sciences, Nanzan University

• Hu MuCi

  Nagoya Institute of Technology

• Ano Katsunori

  Department Of Information Systems & Quantitative Sciences Nanzan University

関連論文

• ON A GENERALIZATION OF THE SECRETARY PROBLEM WITH UNCERTAIN SELECTION
• A Continuous Time Duration Problem With an Unknown Number of Options
• SOME RESULTS ON A BAYESIAN SEQUENTIAL SCHEDULING ON TWO IDENTICAL PARALLEL PROCESSORS
• A secretary problem with uncertain employment and restricted offering chances
• A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED
• MULTIPLE SELECTION PROBLEM AND OLA STOPPING RULE
• A POISSON ARRIVAL SELECTION PROBLEM FOR GAMMA PRIOR INTENSITY WITH NATURAL NUMBER PARAMETER
• OPTIMAL SELECTION PROBLEM WITH THREE STOPS

スポンサーリンク