6 citations · 8 across the 2 of their papers we have counts for
2 papers
math.PR2018★ 2 cited
Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
Alessandro Arlotto, Xinchang Xie
We study a dynamic and stochastic knapsack problem in which a decision maker is sequentially presented with items arriving according to a Bernoulli process over discrete time p…
math.PR2016★ 6 cited
An adaptive -optimal policy for the online selection of a monotone subsequence from a random sample
Alessandro Arlotto, Yehua Wei, Xinchang Xie
Given a sequence of independent random variables with common continuous distribution, we propose a simple adaptive online policy that selects a monotone increasing subsequence.…