Analysis of heuristic solutions to the best choice problem.
From MaRDI portal
Publication:1406961
DOI10.1016/S0377-2217(02)00601-XzbMath1043.90086WikidataQ57309401 ScholiaQ57309401MaRDI QIDQ1406961
Darryl A. Seale, William E. Stein, Amnon Rapoport
Publication date: 7 September 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial probability (60C05)
Related Items (11)
Expected duration of the no-information minimum rank problem ⋮ When to stop -- a cardinal secretary search experiment ⋮ No-information secretary problems with cardinal payoffs and Poisson arrivals ⋮ Lending decisions with limits on capital available: the polygamous marriage problem ⋮ Selection of a correlated equilibrium in Markov stopping games ⋮ Average number of candidates surveyed by the headhunter in the recruitment ⋮ An optimal double stopping rule for a buying-selling problem ⋮ Sequential selections with minimization of failure ⋮ Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem ⋮ Hold or roll: reaching the goal in jeopardy race games ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search
Cites Work
- Unnamed Item
- Who solved the secretary problem
- Dynamic programming formulation of the group interview problem with a general utility function
- Stack-up algorithms for palletizing at delivery industry
- Selecting the best choice in the full information group interview problem
- Optimal selection based on relative rank (the 'Secretary Problem')
- Extremal processes, secretary problems and the 1/e law
- The Secretary Problem and Its Extensions: A Review
- Further Developments and Tests of a Progressive Algorithm for Multiple Criteria Decision Making
- Duration of a secretary problem
- Exact results for a secretary problem
- A Decision Model for the Multiple Criteria Group Secretary Problem: Theoretical Considerations
- A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems
- Dynamic Programming and Decision Theory
This page was built for publication: Analysis of heuristic solutions to the best choice problem.