Dynamic programming formulation of the group interview problem with a general utility function

DOI10.1016/0377-2217(94)90123-6zbMath0812.90075OpenAlexW2054565889MaRDI QIDQ1341989

Young Hak Chun, Robert D. Plante, Herbert Moskowitz

Publication date: 11 January 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90123-6

zbMATH Keywords

dynamic programmingoptimal stoppingsecretary problembackward recursive equationgroup interview problemmanagerial decision

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (6)

Analysis of heuristic solutions to the best choice problem. ⋮ Optimal stopping problems by two or more decision makers: a survey ⋮ Estimating the market shares of stores based on the shopper's search and purchase behavior ⋮ Buying and selling an asset over the finite time horizon: a non-parametric approach ⋮ Selecting the best choice in the full information group interview problem ⋮ Rank-based selection strategies for the random walk process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The secretary problem for a random walk
• The secretary problem as a model of choice
• Optimal stopping with sampling cost: The secretary problem
• Who solved the secretary problem
• Optimal selection based on relative rank (the 'Secretary Problem')
• The Secretary Problem and Its Extensions: A Review
• Optimal Sequential Assignments with Random Arrival Times
• A Bayesian Approach to a Generalized House Selling Problem
• Generalizing the secretary problem
• A Sequential Stochastic Assignment Problem
• Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem

This page was built for publication: Dynamic programming formulation of the group interview problem with a general utility function