A Note on Sequential Selection from Permutations
From MaRDI portal
Publication:4948042
DOI10.1017/S0963548399004149zbMath0943.05002OpenAlexW2154140460MaRDI QIDQ4948042
Publication date: 5 September 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548399004149
Related Items (6)
Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ Asymptotics and renewal approximation in the online selection of increasing subsequence ⋮ Sequential selection of a monotone subsequence from a random permutation ⋮ Sequential selection of an increasing sequence from a multidimensional random sample. ⋮ Optimal rules for the sequential selection of monotone subsequences of maximum expected length
This page was built for publication: A Note on Sequential Selection from Permutations
