Optimal online selection of a monotone subsequence: a central limit theorem
Authors:
- Alessandro ArlottoAAAlessandro Arlotto
- Vinh V. NguyenVNVinh V. Nguyen
- J. Michael SteeleJSJ. Michael Steele
- 1 September 2015
- journal article
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 125 (9) , 3596-3622
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Optimal Sequential Selection of a Unimodal Subsequence of a Random SequenceCombinatorics, Probability and Computing, 2011
- Sequential selection of an increasing subsequence from a sample of random sizeJournal of Applied Probability, 1999
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theoremBulletin of the American Mathematical Society, 1999
- The Height of a Random Partial Order: Concentration of MeasureThe Annals of Applied Probability, 1992
- A note on the selection of random variables under a sum constraintJournal of Applied Probability, 1991
- Optimal Sequential Selection of a Monotone Sequence From a Random SampleThe Annals of Probability, 1981
- A variational problem for random Young tableauxAdvances in Mathematics, 1977
- Dependent Central Limit Theorems and Invariance PrinciplesThe Annals of Probability, 1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973
- Martingale Central Limit TheoremsThe Annals of Mathematical Statistics, 1971