1 citations · 1 across the 2 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2020
Diffusion Approximations in the Online Increasing Subsequence Problem
Alexander Gnedin, Amirlan Seksenbayev
The online increasing subsequence problem is a stochastic optimisation task with the objective to maximise the expected length of subsequence chosen from a random series by means o…
math.PR2019
Asymptotics and Renewal Approximation in the Online Selection of Increasing Subsequence
Alexander Gnedin, Amirlan Seksenbayev
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…