Recognizing both the maximum and the second maximum of a sequence
From MaRDI portal
Publication:3886584
DOI10.2307/3213146zbMath0443.60040OpenAlexW2013038332MaRDI QIDQ3886584
No author found.
Publication date: 1979
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213146
dynamic programmingMarkov decision processoptimal stopping rulesecretary problemsequential decision analysis
Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)
Related Items (13)
Optimal selection of the four best of a sequence ⋮ Bilateral Secretary Problem Recognizing the Maximum or the Second Maximum of a Sequence ⋮ Optimal selection of the \(k\) best of a sequence with \(k\) stops ⋮ A satisficing policy of the secretary problem: theory and simulation ⋮ Shelf life of candidates in the generalized secretary problem ⋮ On a duration problem with unbounded geometrical horizon ⋮ Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Optimal stopping methodology for the secretary problem with random queries ⋮ Buying and selling an asset over the finite time horizon: a non-parametric approach ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ A nonparametric predictive approach to sequential acceptance problems ⋮ Some Extensions of Generalized Secretary Problem
This page was built for publication: Recognizing both the maximum and the second maximum of a sequence
