Extremal processes, secretary problems and the 1/e law
The basic assumption in most versions of the classical ``Secretary Problem is that the order of arrival of the n candidates to be interviewed is totally random, assigning an equal probability of 1/n! to each of the possible permutations of the candidates' ranks. It follows that, if \(X_ i\) is the rank of the i-th candidate to appear, then \(\{X_ i\}\), \(i=1,...,n\), is a sequence of independent random variables, each of which is uniformly distributed on the integers 1,...,n. In the problem considered here, \(X_ 1,...,X_ n\) are still assumed to be independent, but the distribution of \(X_ i\) is assumed to be of the form \(F^{\alpha_ i} (\alpha_ i>0)\). This extension allows for situations in which the best candidates are clustered either at the beginning (the sequence \(\{\alpha_ i\}\) is decreasing) or at the end (the sequence \(\{\alpha_ i\}\) is increasing) of the arrival process. Let \(p_ i=\alpha_ i/\sum^{i}_{k=1}\alpha_ k\); the main result of the paper states that, assuming \(\sum^{\infty}_{i=1}p_ i=\infty\) and \(\sum^{\infty}_{i=1}p_ i^ 2<\infty\), then the probability of selecting the best candidate is asymptotically equal to 1/e, as in the classical version of the problem.
- A new semigroup technique in Poisson approximation
- On the optimality of multivariate Poisson approximation
- Records in the \(F^ \alpha\)-scheme. I: Martingale properties
- A dependent F^ -scheme
- Analysis of heuristic solutions to the best choice problem.
- Opportunity costs in the game of best choice
- Sum the odds to one and stop
- On record indices and record times
- Strong approximation of the number of renewal paced record times
- Asymptotic distributions of records in nonstationary schemes
- A semigroup approach to Poisson approximation with respect to the point metric
- The secretary problem with biased arrival order via a Mallows distribution
- On the use of the Borel-Cantelli lemma in Markov chains
- Best choice from the planar Poisson process
- Lower bounds for Bruss' odds problem with multiple stoppings
- Probability maximizing approach to a secretary problem by random change-point of the distribution law of the observed process
- Recognising the last record of sequence
- scientific article; zbMATH DE number 3896008 (Why is no real title available?)
- Strong Approximations For It-Records And Records In TheFα-Scheme-A Duality
- Order statistics and exceedances for some models of INID random variables
- Estimation of the parameter of a dynamically selected population for two subclasses of the exponential family
- Limit theorems for record indicators in threshold \(F^\alpha \)-schemes
- Weighted games of best choice
- Number of observations near the maximum in an \(F^{\alpha}\)-scheme
- Extreme(ly) mean(ingful): sequential formation of a quality group
- The secretary problem with non-uniform arrivals via a left-to-right minimum exponentially tilted distribution
- Two measures of efficiency for the secretary problem with multiple items at each rank
- The last-success stopping problem with random observation times
- Infinite size-biased orders
- Minimax-optimal stop rules and distributions in secretary problems
This page was built for publication: Extremal processes, secretary problems and the 1/e law
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468385)