Extremal processes, secretary problems and the 1/e law

DOI10.2307/3214377zbMath0693.60030OpenAlexW2168950730WikidataQ94824353 ScholiaQ94824353MaRDI QIDQ3468385

Dietmar Pfeifer

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214377

zbMATH Keywords

record valuesnon-homogeneous Poisson processesprobability of selecting the best candidateSecretary Problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items

Strong Approximations For It-Records And Records In TheF^α-Scheme-A Duality ⋮ Records in the \(F^ \alpha\)-scheme. I: Martingale properties ⋮ A dependent \(F^ \alpha\)-scheme ⋮ On record indices and record times ⋮ Strong approximation of the number of renewal paced record times ⋮ Asymptotic distributions of records in nonstationary schemes ⋮ Number of observations near the maximum in anF^α-scheme ⋮ A semigroup approach to Poisson approximation with respect to the point metric ⋮ The secretary problem with biased arrival order via a Mallows distribution ⋮ A new semigroup technique in Poisson approximation ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ Limit Theorems for Record Indicators in Threshold $F^\alpha$-Schemes ⋮ Unnamed Item ⋮ Order statistics and exceedances for some models of INID random variables ⋮ On the use of the Borel-Cantelli lemma in Markov chains ⋮ Opportunity costs in the game of best choice ⋮ On the optimality of multivariate Poisson approximation ⋮ Best choice from the planar Poisson process ⋮ Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings ⋮ Weighted Games of Best Choice ⋮ Estimation of the parameter of a dynamically selected population for two subclasses of the exponential family ⋮ Recognising the last record of sequence ⋮ Sum the odds to one and stop

This page was built for publication: Extremal processes, secretary problems and the 1/e law