Selecting the best choice in the full information group interview problem

DOI10.1016/S0377-2217(98)00341-5zbMath0938.90072MaRDI QIDQ1809843

Young Hak Chun

Publication date: 27 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingdecision analysisstochastic model applicationssequential decision makinggroup interview problem

Mathematics Subject Classification ID

Decision theory (91B06) Dynamic programming (90C39)

Related Items (4)

Multi-attribute sequential decision problem with optimizing and satisficing attributes ⋮ Lending decisions with limits on capital available: the polygamous marriage problem ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of optimal search
• Dynamic programming formulation of the group interview problem with a general utility function
• Optimal Stopping With Random Horizon With Application to the Full-Information Best-Choice Problem With Random Freeze
• Optimal Persistence Policies
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• The Secretary Problem and Its Extensions: A Review
• Optimal Strategies for Selling an Asset
• A Bayesian Approach to a Generalized House Selling Problem
• Adaptive disposal models
• An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period

This page was built for publication: Selecting the best choice in the full information group interview problem