Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
From MaRDI portal
Publication:3103629
DOI10.1017/S0963548311000411zbMath1229.60050arXiv1108.2633OpenAlexW2098721830MaRDI QIDQ3103629
Alessandro Arlotto, J. Michael Steele
Publication date: 8 December 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2633
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Related Items (7)
Markov Decision Problems Where Means Bound Variances ⋮ Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Optimal online selection of a monotone subsequence: a central limit theorem ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ Sequential Search Beats Best-of-NSearch ⋮ The BRS-inequality and its applications ⋮ Quickest online selection of an increasing subsequence of specified size
Cites Work
- A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
- Long unimodal subsequences: a problem of F. R. K. Chung
- On unimodal subsequences
- Stochastic optimal control. The discrete time case
- Optimal sequential selection of a monotone sequence from a random sample
- The height of a random partial order: Concentration of measure
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
- A note on the selection of random variables under a sum constraint
- On the distribution of the length of the longest increasing subsequence of random permutations
- Sequential selection of an increasing subsequence from a sample of random size
This page was built for publication: Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
