A markov chain version of the secretary problem
From MaRDI portal
Publication:4124634
DOI10.1002/NAV.3800230114zbMath0353.90090OpenAlexW2036386642MaRDI QIDQ4124634
Publication date: 1976
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800230114
Markov and semi-Markov decision processes (90C40) Operations research and management science (90B99)
Related Items (5)
Asymptotic analysis for multi-objective sequential stochastic assignment problems ⋮ Approximation algorithms for stochastic online matching with reusable resources ⋮ Extensions of the sequential stochastic assignment problem ⋮ The Stochastic Sequential Assignment Problem With Random Deadlines ⋮ Unnamed Item
This page was built for publication: A markov chain version of the secretary problem
