A SELECTION PROBLEM WITH COST : 'SECRETARY PROBLEM' WHEN UNLIMITED RECALL IS ALLOWED
From MaRDI portal
Publication:5288736
DOI10.15807/JORSJ.35.373zbMATH Open0771.62060OpenAlexW613596165MaRDI QIDQ5288736FDOQ5288736
Authors: Shigeichi Moriguchi
Publication date: 17 August 1993
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.35.373
Recommendations
Cited In (6)
- The Secretary Problem—An Update
- The infinite secretary problem with recall
- ASYMPTOTIC THEORY OF SELECTION BY RELATIVE RANK WITH LOW COST
- Optimal Sequential Selection Based on Relative Ranks with Renewable Call Options
- The secretary problem : optimal selection with batch-interviewing and cost
- The secretary problem with a call option
This page was built for publication: A SELECTION PROBLEM WITH COST : 'SECRETARY PROBLEM' WHEN UNLIMITED RECALL IS ALLOWED
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288736)