Diffusion approximations in the online increasing subsequence problem
- 1 September 2021
- journal article
- research article
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 139, 298-320
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- On sequential selection and a first passage problem for the Poisson processElectronic Communications in Probability, 2021
- An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sampleRandom Structures & Algorithms, 2017
- Optimal online selection of a monotone subsequence: a central limit theoremStochastic Processes and their Applications, 2015
- Maxima in hypercubesRandom Structures & Algorithms, 2005
- A central limit theorem for the optimal selection process for monotone subsequences of maximum expected lengthStochastic Processes and their Applications, 2004
- Optimal rules for the sequential selection of monotone subsequences of maximum expected lengthStochastic Processes and their Applications, 2001
- Record sequences and their applications2001
- Sequential selection of an increasing subsequence from a sample of random sizeJournal of Applied Probability, 1999
- Optimal selection of stochastic intervals under a sum constraintAdvances in Applied Probability, 1987
- Optimal Sequential Selection of a Monotone Sequence From a Random SampleThe Annals of Probability, 1981