A markov chain version of the secretary problem

DOI10.1002/NAV.3800230114MaRDI QIDQ4124634zbMATH OpenOpenAlexFDO

Authors S. Christian Albright

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

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Operations research and management science (90B99)

Cited in

(5)

• Extensions of the sequential stochastic assignment problem
• Approximation algorithms for stochastic online matching with reusable resources
• Limiting behavior of the target-dependent stochastic sequential assignment problem
• Asymptotic analysis for multi-objective sequential stochastic assignment problems
• The Stochastic Sequential Assignment Problem With Random Deadlines

This page was built for publication: A markov chain version of the secretary problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124634)