A markov chain version of the secretary problem
From MaRDI portal
Publication:4124634
DOI10.1002/NAV.3800230114zbMATH Open0353.90090OpenAlexW2036386642MaRDI QIDQ4124634FDOQ4124634
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
Markov and semi-Markov decision processes (90C40) Operations research and management science (90B99)
Cited In (5)
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- The Stochastic Sequential Assignment Problem With Random Deadlines
- Extensions of the sequential stochastic assignment problem
- Limiting behavior of the target-dependent stochastic sequential assignment problem
- Approximation algorithms for stochastic online matching with reusable resources
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)
