Logarithmic regret in the dynamic and stochastic knapsack problem. - Alessandro Arlotto; Xinchang Xie (CoRR, 2018)

An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. - Alessandro Arlotto; Yehua Wei; Xinchang Xie (Random Struct. Algorithms, 2018)

Dynamic Allocation of Reusable Resources: Logarithmic Regret in Overloaded Networks. - Xinchang Xie; Itai Gurvich; Simge Küçükyavuz (Oper. Res., 2025)