A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
type: Item
instance of: scholarly article
title: A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length
zbMATH Open document ID: 1071.60021
author: F. Thomas Bruss
author: Freddy Delbaen
published in: Stochastic Processes and their Applications
publication date: 2005-06-22T00:00:00Z
review text: Let \((N_s)_{s \geq 0}\) be a Poisson process with intensity 1 and with occurrence times \(0<T_1<T_2< \cdots \) a.s., \(T_0=0\). Let \((X_k)_{k=1,2, \ldots}\) be a sequence of i.i.d. uniform random variables on \([0,1]\), independent of the \(T_j\)'s. The random vectors \((T_k,X_k)\) are observed sequentially. For a given horizon \(t\), consider the objective to select in sequential order, without recall on preceding observation, a subsequence \((T_{k_1},X_{k_1}),(T_{k_2},X_{k_2}),\ldots\) satisfying \(X_{k_1}\leq X_{k_2} \leq \cdots\) for \(0<k_1<k_2<\cdots\) and \(T_{k_i}\leq t \), consisting of as many elements as possible. Denote by \(L^t_u\) the number of the selected values up to time \(u\) under the \(t\)-optimal strategy. The authors study the stochastic process \((L^t_u)_{0 \leq u \leq t}\). They prove a functional central limit theorem for this process as \(t\) tends to infinity.
reviewed by: Wiesław Dziubdziela
Mathematics Subject Classification ID: 60F17
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 2177810
zbMATH Keywords: functional central limit theorem
zbMATH Keywords: optimal selection process
MaRDI profile type: Publication
full work available at URL: j.spa.2004.09.002
OpenAlex ID: W1975832153
Wikidata QID: Q56004221
cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
cites work: On the distribution of the length of the longest increasing subsequence of random permutations
cites work: Optimal rules for the sequential selection of monotone subsequences of maximum expected length
cites work: ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
cites work: Optimal selection of stochastic intervals under a sum constraint
cites work: Sequential selection of an increasing subsequence from a random sample with geometrically distributed sample-size
cites work: Ulam's problem and Hammersley's process
cites work: Q3774629
cites work: Moderate deviations for longest increasing subsequences: The lower tail
cites work: A note on the selection of random variables under a sum constraint
cites work: Optimal sequential selection of a monotone sequence from a random sample
DOI: 10.1016/J.SPA.2004.09.002
description: scientific article; zbMATH DE number 2177810