Improved Algorithms and Analysis for Secretary Problems and Generalizations
From MaRDI portal
Publication:2706186
DOI10.1137/S0895480195290017zbMath0969.65058MaRDI QIDQ2706186
Nimrod Megiddo, Miklós Ajtai, Orli Waarts
Publication date: 19 March 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480195290017
dynamic programming; optimal stopping; maximization; explicit algorithms; secretary problems; expected rank
Related Items
Unnamed Item, Strong Algorithms for the Ordinal Matroid Secretary Problem, Prophet Secretary, Analysis of the ``hiring above the median selection strategy for the hiring problem, Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks, Analysis of the strategy ``hiring above the \(m\)-th best candidate, Delay-tolerant delivery of quality information in ad hoc networks, Optimal algorithms for \(k\)-search with application in option pricing, The solution of a generalized secretary problem via analytic expressions, A unified approach for solving sequential selection problems, New results for the \(k\)-secretary problem, Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract), Prophet Secretary, Online Appointment Scheduling in the Random Order Model
