We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that it tells us that the expected value of optimal selection from a random permutation is quantifiably larger than optimal sequential selection from an independent sequence of uniformly distributed random variables; specifically, it is larger by at least (1/6) log n + O(1)
We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequ...
We compute the limiting distributions of the lengths of the longest monotone subsequences of random ...
AbstractThe number Xn of increasing subsequences of the n-long random permutation is studied. Asympt...
We find a two term asymptotic expansion for the optimal expected value of a sequentially selected mo...
The length of the longest monotone increasing subsequence of a random sample of size n is known to h...
AbstractThis article presents new results on the problem of selecting (online) a monotone subsequenc...
Consider a sequence of n independent random variables with a common continuous distribution F, and c...
We consider sequential selection of an alternating subsequence from a sequence of independent, ident...
In the stochastic sequential optimisation problems it is of interest to study features of strategies...
Given a sequence of independent random variables with a common continuous distribution, we consider ...
We consider the problem of selecting sequentially a unimodal subsequence from a sequence of independ...
This article presents new results on the problem of selecting (online) a monotone subsequence of max...
In the first part of this dissertation, we consider two problems in sequential decision making. The ...
This article provides a refinement of the main results for the monotone subsequence selection proble...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequ...
We compute the limiting distributions of the lengths of the longest monotone subsequences of random ...
AbstractThe number Xn of increasing subsequences of the n-long random permutation is studied. Asympt...
We find a two term asymptotic expansion for the optimal expected value of a sequentially selected mo...
The length of the longest monotone increasing subsequence of a random sample of size n is known to h...
AbstractThis article presents new results on the problem of selecting (online) a monotone subsequenc...
Consider a sequence of n independent random variables with a common continuous distribution F, and c...
We consider sequential selection of an alternating subsequence from a sequence of independent, ident...
In the stochastic sequential optimisation problems it is of interest to study features of strategies...
Given a sequence of independent random variables with a common continuous distribution, we consider ...
We consider the problem of selecting sequentially a unimodal subsequence from a sequence of independ...
This article presents new results on the problem of selecting (online) a monotone subsequence of max...
In the first part of this dissertation, we consider two problems in sequential decision making. The ...
This article provides a refinement of the main results for the monotone subsequence selection proble...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequ...
We compute the limiting distributions of the lengths of the longest monotone subsequences of random ...
AbstractThe number Xn of increasing subsequences of the n-long random permutation is studied. Asympt...
Add to ORKG