


















We revisit the problem of maximising the expected length of increasing subsequence that can be selected from a marked Poisson process by an online strategy. Resorting to a natural size variable, the problem is represented in terms of a controlled partially deterministic Markov process with decreasing paths. Refining known estimates we obtain fairly complete asymptotic expansions for the moments, and using a renewal approximation give a novel proof of the central limit theorem for the length of selected subsequence under the optimal strategy.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。