Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
From MaRDI portal
Publication:2942668
DOI10.1007/978-3-319-13075-0_52zbMath1433.91080arXiv1405.5975OpenAlexW2963228229MaRDI QIDQ2942668
No author found.
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.5975
Related Items (2)
A satisficing policy of the secretary problem: theory and simulation ⋮ The solution of a generalized secretary problem via analytic expressions
This page was built for publication: Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol