Improved Algorithms and Analysis for Secretary Problems and Generalizations
From MaRDI portal
Publication:2706186
DOI10.1137/S0895480195290017zbMath0969.65058OpenAlexW2085355319MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Prophet Secretary ⋮ Optimal algorithms for \(k\)-search with application in option pricing ⋮ Prophet Secretary ⋮ Online Appointment Scheduling in the Random Order Model ⋮ New results for the \(k\)-secretary problem ⋮ Analysis of the ``hiring above the median selection strategy for the hiring problem ⋮ A unified approach for solving sequential selection problems ⋮ Delay-tolerant delivery of quality information in ad hoc networks ⋮ Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks ⋮ Analysis of the strategy ``hiring above the \(m\)-th best candidate ⋮ The solution of a generalized secretary problem via analytic expressions ⋮ Unnamed Item ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem
This page was built for publication: Improved Algorithms and Analysis for Secretary Problems and Generalizations
