 Decoupling Learning and Decision-Making: Breaking the Barrier in Online Resource Allocation with First-Order MethodsInternational Conference on Machine Learning (ICML), 2024 |
 Online Stochastic Optimization with Wasserstein Based Non-stationarityManagement Sciences (MS), 2020 |
 The Best of Many Worlds: Dual Mirror Descent for Online Allocation
ProblemsOperational Research (OR), 2020 |
 Logarithmic Regret in Multisecretary and Online Linear Programs with
Continuous ValuationsOperational Research (OR), 2019 |
 Online Linear Programming: Dual Convergence, New Algorithms, and Regret
BoundsOperational Research (OR), 2019 Xiaocheng Li Yinyu Ye |
 Online Allocation and Pricing: Constant Regret via Bellman InequalitiesOperational Research (OR), 2019 |
 Geometry of Online Packing Linear ProgramsInternational Colloquium on Automata, Languages and Programming (ICALP), 2012 |
