Journal of Statistical Theory and Practice

, Volume 6, Issue 3, pp 383–401 | Cite as

A Nonparametric Predictive Approach to Sequential Acceptance Problems

  • Mohamed A. ElsaeitiEmail author
  • Frank P. A. Coolen


Sequential acceptance problems are considered with the aim to select candidates from a group, with the candidates observed sequentially, either per individual or in subgroups, and with the ordering of an individual compared to previous candidates and those in the same subgroup available. For given total group size, this problem can in principle be solved by dynamic programming, but the computational effort required makes this not feasible for problems once the number of candidates to be selected and the total group size are not small. We present a new heuristic approach to such problems, based on the principles of nonparametric predictive inference, and we study its performance via simulations, which are also used to compare the method with some alternatives. The approach is easy to implement and computationally straightforward.

60A99 62G99 62P30 


Acceptance decisions Dynamic programming Heuristics Marriage problem Nonparametric predictive inference Secretary problem Sequential decisions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Augustin, T., and F. P. A. Coolen. 2004. Nonparametric predictive inference and interval probability. J. Stat. Plan. Inference, 124, 251–272.CrossRefGoogle Scholar
  2. Chow, Y. S., S. Moriguti, H. Robbins, and S. M. Samuels. 1964. Optimal selection based on relative rank. Israel J. Math., 2, 81–90.MathSciNetCrossRefGoogle Scholar
  3. Coolen, F. P. A., 2006. On nonparametric predictive inference and objective Bayesianism. J. Logic Language Information 15, 21–47.MathSciNetCrossRefGoogle Scholar
  4. Coolen, F. P. A., 2011. Nonparametric predictive inference. In International encyclopedia of statistical science, ed. M. Lovric, 968–970. Berlin, Springer.CrossRefGoogle Scholar
  5. Coolen, F. P. A., and M. A. Elsaeiti. 2009. Nonparametric predictive methods for acceptance sampling. J. Stat. Theory Pract., 3, 907–921.MathSciNetCrossRefGoogle Scholar
  6. Elsaeiti, M. A., 2012. Nonparametric predictive inference for acceptance decisions. PhD thesis, Durham University, UK. Available from Scholar
  7. Freeman, P. R., 1983. The secretary problem and its extensions: A review. Int. Stat. Rev., 51, 189–206.MathSciNetCrossRefGoogle Scholar
  8. Henke, M. 1973. Expectations and variances of stopping variables in sequential selection processes. J. Appl. Probability, 10, 786–806.MathSciNetCrossRefGoogle Scholar
  9. Krieger, A. M., M. Pollak, and E. Samuel-Cahn. 2007. Select sets: rank and file. Ann. Appl. Probability,17, 360–385.MathSciNetCrossRefGoogle Scholar
  10. Krieger, A. M., M. Pollak, and E. Samuel-Cahn. 2008. Beat the mean: sequential selection by better than average rules. J. Appl. Probability, 45, 244–259.MathSciNetCrossRefGoogle Scholar
  11. Lindley, D. V. 1961. Dynamic programming and decision theory. Appl. Stat., 10, 39–51.MathSciNetCrossRefGoogle Scholar
  12. Preater, J. 2000. Sequential selection with a better-than-average rule. Stat. Probability Lett., 50, 187–191.MathSciNetCrossRefGoogle Scholar
  13. Preater, J. 2006. On-line selection of an acceptable pair. J. Appl. Probability, 43, 729–740.MathSciNetCrossRefGoogle Scholar
  14. Samuels, S. 1991. Secretary problems. In Handbook of sequential analysis, ed. B. K. Ghosh and P. K. Sen, 381–405. Boca Raton, FL: CRC Press.Google Scholar
  15. Tamaki, M. 1979. Recognizing both the maximum and the second maximum of a sequence. J. Appl. Probability, 16, 803–812.MathSciNetCrossRefGoogle Scholar
  16. Tamaki, M. 1991. A secretary problem with uncertain employment and best choice of available candidates. Operations Res., 39, 274–284.CrossRefGoogle Scholar

Copyright information

© Grace Scientific Publishing 2012

Authors and Affiliations

  1. 1.Department of Mathematical SciencesDurham UniversityDurhamUK

Personalised recommendations