A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
DOI10.1016/J.SPA.2004.09.002zbMATH Open1071.60021OpenAlexW1975832153WikidataQ56004221 ScholiaQ56004221MaRDI QIDQ556644FDOQ556644
Authors: F. Thomas Bruss, Freddy Delbaen 
Publication date: 22 June 2005
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spa.2004.09.002
Recommendations
- Optimal online selection of a monotone subsequence: a central limit theorem
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample
- Asymptotics and renewal approximation in the online selection of increasing subsequence
- Optimal online selection of an alternating subsequence: a central limit theorem
Functional limit theorems; invariance principles (60F17) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Title not available (Why is that?)
- On the distribution of the length of the longest increasing subsequence of random permutations
- Optimal sequential selection of a monotone sequence from a random sample
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Moderate deviations for longest increasing subsequences: The lower tail
- ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- A note on the selection of random variables under a sum constraint
- Ulam's problem and Hammersley's process
- Sequential selection of an increasing subsequence from a random sample with geometrically distributed sample-size
- Optimal selection of stochastic intervals under a sum constraint
Cited In (14)
- Optimal sequential selection of a unimodal subsequence of a random sequence
- Markov decision problems where means bound variances
- Online Selection of Alternating Subsequences from a Random Sample
- 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
- The BRS-inequality and its applications
- Diffusion approximations in the online increasing subsequence problem
- Asymptotic expansions and strategies in the online increasing subsequence problem
- On sequential selection and a first passage problem for the Poisson process
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length
- Quickest online selection of an increasing subsequence of specified size
- Sequential selection of a monotone subsequence from a random permutation
- Optimal online selection of a monotone subsequence: a central limit theorem
This page was built for publication: A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556644)
