Sequential selection of an increasing subsequence from a sample of random size
From MaRDI portal
Publication:4954239
DOI10.1239/jap/1032374756zbMath0960.62084OpenAlexW2089270778MaRDI QIDQ4954239
Publication date: 18 May 2000
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1032374756
Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Related Items (13)
A unified approach for solving sequential selection problems ⋮ Asymptotic expansions and strategies in the online increasing subsequence problem ⋮ Optimal online selection of a monotone subsequence: a central limit theorem ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ The BRS-inequality and its applications ⋮ Asymptotics and renewal approximation in the online selection of increasing subsequence ⋮ Diffusion approximations in the online increasing subsequence problem ⋮ Quickest online selection of an increasing subsequence of specified size ⋮ Sequential selection of a monotone subsequence from a random permutation ⋮ On sequential selection and a first passage problem for the Poisson process ⋮ Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence ⋮ Online Selection of Alternating Subsequences from a Random Sample ⋮ Optimal rules for the sequential selection of monotone subsequences of maximum expected length
This page was built for publication: Sequential selection of an increasing subsequence from a sample of random size
