Selecting the best choice in the full information group interview problem
type: Item
instance of: scholarly article
title: Selecting the best choice in the full information group interview problem
zbMATH Open document ID: 0938.90072
DOI: 10.1016/S0377-2217(98)00341-5
published in: European Journal of Operational Research
publication date: 2000-06-27T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 91B06
zbMATH DE Number: 1370727
zbMATH Keywords: stochastic model applications
zbMATH Keywords: decision analysis
zbMATH Keywords: sequential decision making
zbMATH Keywords: group interview problem
zbMATH Keywords: dynamic programming
author: Young H. Chun
MaRDI profile type: Publication
cites work: A Bayesian Approach to a Generalized House Selling Problem
cites work: Dynamic programming formulation of the group interview problem with a general utility function
cites work: Adaptive disposal models
cites work: The Secretary Problem and Its Extensions: A Review
cites work: Q5517486
cites work: Optimal Persistence Policies
cites work: An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period
cites work: Optimal Strategies for Selling an Asset
cites work: Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
cites work: Q3342240
cites work: Optimal Stopping With Random Horizon With Application to the Full-Information Best-Choice Problem With Random Freeze
cites work: Theory of optimal search
cites work: Q4023134
description: scientific article; zbMATH DE number 1370727