arXiv 1108.26332011-08math.PRmath.COmath.OC

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence

Alessandro Arlotto, J. Michael Steele

发表信息：: Combinatorics, Probability and Computing (2011) 20, 799--814
DOI：: 10.1017/S0963548311000411

英文摘要：

We consider the problem of selecting sequentially a unimodal subsequence from a sequence of independent identically distributed random variables, and we find that a person doing optimal sequential selection does within a factor of the square root of two as well as a prophet who knows all of the random observations in advance of any selections. Our analysis applies in fact to selections of subsequences that have d+1 monotone blocks, and, by including the case d=0, our analysis also covers monotone subsequences.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On-Line Selection of Alternating Subsequences from a Random Sample

We consider sequential selection of an alternating subsequence from a sequence of independent, identically distributed, continuous random variables, and we determine the exact asymptotic behavior of an optimal sequentially selected subsequence. Moreover, we find (in a sense we make precise) that a person who is constrained to make sequential selections does only about 12% worse than a person who can make selections with full knowledge of the random sequence.

2011-07-01math.OCmath.PR

Sequential Selection of a Monotone Subsequence from a Random Permutation

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 tells us that the expected value of optimal selection from a random permutation is quantifiably larger than optimal sequential selection from an independent sequences of uniformly distributed random variables; specifically, it is larger by at least (1/6)log n +O(1).

2015-09-15math.PR

Optimal On-Line Selection of an Alternating Subsequence: A Central Limit Theorem

We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequence of $n$ independent observations from a continuous distribution $F$, and we prove a central limit theorem for the number of selections made by that policy. The proof exploits the backward recursion of dynamic programming and assembles a detailed understanding of the associated value functions and selection rules.

2013-06-09math.OCmath.PR

Optimal Online Selection of a Monotone Subsequence: a Central Limit Theorem

Consider a sequence of $n$ independent random variables with a common continuous distribution $F$, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be accepted or rejected when it is first revealed. There is a unique selection policy $π_n^*$ that is optimal in the sense that it maximizes the expected value of $L_n(π_n^*)$, the number of selected observations. We investigate the distribution of $L_n(π_n^*)$; in particular, we obtain a central limit theorem for $L_n(π_n^*)$ and a detailed understanding of i…

2015-03-29math.OCmath.PR

On sequential selection and a first passage problem for the Poisson process

This note is motivated by connections between the online and offline problems of selecting a possibly long subsequence from a Poisson-paced sequence of uniform marks under either a monotonicity or a sum constraint. The offline problem with the sum constraint amounts to counting the Poisson arrivals before their total exceeds a certain level. A precise asymptotics for the mean count is obtained by coupling with a nonlinear pure birth process.

2020-07-15math.PR

Inversions and Longest Increasing Subsequence for $k$-Card-Minimum Random Permutations

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $σ$ is simply the sequence of cards in the order they are removed. This permutation is itself uniformly random, as long as each random card $C_t$ is drawn uniformly from the remaining set at time $t$. We consider, here, a variant of this simple procedure in which one is given a choice between $k$ random cards from the remaining set at each step, and selects the lowest numbered of these for removal. This induces a bias towards selecting lower num…

2014-06-16math.PR

更多相关论文收起更多论文

The Bruss-Robertson Inequality: Elaborations, Extensions, and Applications

The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the summands nor requires the equality of their marginal distributions. A review is also given of the applications of the Bruss-Robertson inequality, especially the applications to problems of combinatorial optimization such as the sequential knapsack problem and the sequential monotone subsequence selection problem.

2015-10-03math.PR