论文标题
关于顺序选择和泊松过程的第一个段落问题
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.
