An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period

DOI10.1287/opre.34.3.478zbMath0614.90071OpenAlexW2027212201MaRDI QIDQ4723565

Tōru Nakai

Publication date: 1986

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.34.3.478

zbMATH Keywords

secretary problemoptimal selection

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Operations research and management science (90B99)

Related Items (3)

Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ An interactive method for the optimal selection problem with two decision makers ⋮ Selecting the best choice in the full information group interview problem

This page was built for publication: An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period