Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-02-11T06:49:02.733Z Has data issue: false hasContentIssue false
  • English
  • Français

ANALYTIC METHODS FOR SELECT SETS

Published online by Cambridge University Press:  30 July 2012

J. Gaither  and
M.D. Ward
J. Gaither
Affiliation:
Department of Mathematics, Purdue University, West Lafayette, IN 47907 E-mail: jgaither@math.purdue.edu
M.D. Ward
Affiliation:
Department of Statistics, Purdue University, West Lafayette IN 47907 E-mail: mdw@purdue.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We analyze the asymptotic number of items chosen in a selection procedure. The procedure selects items whose rank among all previous applicants is within the best 100p percent of the number of previously selected items. We use analytic methods to obtain a succinct formula for the first-order asymptotic growth of the expected number of items chosen by the procedure.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 26 , Issue 4 , October 2012 , pp. 561 - 568
Copyright
Copyright © Cambridge University Press 2012

References

1.Flajolet, P. & Sedgewick, R. (2009). Analytic combinatorics. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
2.Krieger, A.M., Pollak, M., & Samuel-Cahn, E. (2007). Select sets: Rank and file. Annals of Applied Probability, 17: 360–385.CrossRefGoogle Scholar
3.Szpankowski, W. (2001). Average case analysis of algorithms on sequences. New York: Wiley.CrossRefGoogle Scholar