On a Generalization of the Best Choice Problem

Abstract

Previous article Next article On a Generalization of the Best Choice ProblemM. L. NikolaevM. L. Nikolaevhttps://doi.org/10.1137/1122023PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] M. Gardner, Mathematical games, Sci. Amer., 202 (1960), 150–156, 202 (1960), pp. 172–182 CrossrefGoogle Scholar[2] E. B. Dynkin, The optimal choice of the moment of stopping of a Markov process, Soviet Math. Dokl., 4 (1963), 627–629, (In Russian.) 0242.60018 Google Scholar[3] E. B. Dynkin and , A. A. Yuskevick, Theorems and Problems in Markov Processes, Plenum Press, New York, 1969 CrossrefGoogle Scholar[4] A. N. Širjaev, Statistical sequential analysis, American Mathematical Society, Providence, R.I., 1973iv+174, Vol. 38 of Translations of Math. Monographs MR0350990 Google Scholar[5] S. M. Gusein-Zade, The problem of choice and the optimal stopping rule for a sequence of independent trials, Theory Prob. Applications, 11 (1966), 472–475 10.1137/1111050 LinkGoogle Scholar[6] Gus W. Haggstrom, Optimal sequential procedures when more than one stop is required, Ann. Math. Statist., 38 (1967), 1618–1626 MR0217946 0189.18301 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Improved Online Algorithms for Knapsack and GAP in the Random Order Model17 February 2021 | Algorithmica, Vol. 83, No. 6 Cross Ref Softwarecast: A code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc NetworksAd Hoc Networks, Vol. 55 Cross Ref The Secretary Problem with a Choice Function27 November 2015 Cross Ref Duration problem with multiple exchangesNumerical Algebra, Control and Optimization, Vol. 2, No. 2 Cross Ref Estimating Optimal Stopping Rules in the Multiple Best Choice Problem with Minimal Summarized Rank via the Cross-Entropy Method Cross Ref Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the Cross-Entropy method Cross Ref Continuation theorems of the extremes under power normalizationJournal of Applied Mathematics and Computing, Vol. 10, No. 1-2 Cross Ref Improved Algorithms and Analysis for Secretary Problems and GeneralizationsMiklos Ajtai, Nimrod Megiddo, and Orli Waarts1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 14, No. 1AbstractPDF (259 KB)Optimal selection of thek best of a sequence withk stopsMathematical Methods of Operations Research, Vol. 46, No. 2 Cross Ref SELECTING SATISFACTORY SECRETARIES28 June 2008 | Australian Journal of Statistics, Vol. 36, No. 2 Cross Ref Optimal selection of the four best of a sequenceZOR Zeitschrift f� Operations Research Methods and Models of Operations Research, Vol. 38, No. 3 Cross Ref Optimal choice and assignment of the best m of n randomly arriving itemsStochastic Processes and their Applications, Vol. 39, No. 2 Cross Ref Some Extensions of Generalized Secretary ProblemJournal of Information and Optimization Sciences, Vol. 10, No. 2 Cross Ref Asymptotic results for the best-choice problem with a random number of objects14 July 2016 | Journal of Applied Probability, Vol. 21, No. 3 Cross Ref The d choice secretary problem29 March 2007 | Communications in Statistics. Part C: Sequential Analysis, Vol. 2, No. 3 Cross Ref Improved algorithms and analysis for secretary problems and generalizations Cross Ref Volume 22, Issue 1| 1977Theory of Probability & Its Applications History Submitted:15 June 1975Published online:17 July 2006 InformationCopyright © 1977 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1122023Article page range:pp. 187-190ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics