14 citations · 45 across the 11 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
Competitive Analysis of Stock-based Thresholds via Prophet Inequalities in Continuous Time
Jiashuo Jiang
We study a continuous-time -unit online resource allocation problem with nonhomogeneous Poisson arrivals and time-varying valuation distributions. While the optimal dynamic poli…
cs.LG2026
Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation
Yiming Zong, Jiashuo Jiang
We consider the dynamic resource allocation problem where the decision space is finite-dimensional, yet the solution must satisfy a large or even infinite number of constraints rev…
cs.LG2026
Non-Stationary Online Resource Allocation: Learning from a Single Sample
Yiding Feng, Jiashuo Jiang, Yige Wang
We study online resource allocation under non-stationary demand with a minimum offline data requirement. In this problem, a decision-maker must allocate multiple types of resources…