Dynamic programming and the secretary problem
From MaRDI portal
Publication:918875
DOI10.1016/0898-1221(90)90145-AzbMath0706.90089MaRDI QIDQ918875
Publication date: 1990
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Dynamic programming (90C39) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (1)
Cites Work
This page was built for publication: Dynamic programming and the secretary problem