Online Linear Programming: Dual Convergence, New Algorithms, and Regret
Bounds

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

12 September 2019

Xiaocheng Li

Papers citing "Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds"

9 / 9 papers shown

Title
Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices Ruicheng Ao Jiashuo Jiang D. Simchi-Levi 78 2 0 24 Jan 2025
$Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods$ Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods Wenzhi Gao Chunlin Sun Chenyu Xue Dongdong Ge Yinyu Ye 69 1 0 08 Jan 2025
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions Jiashuo Jiang Will Ma Jiawei Zhang 31 14 0 03 Jan 2025
Infrequent Resolving Algorithm for Online Linear Programming Guokai Li Yuan Wang Mingjie Li 36 1 0 01 Aug 2024
Trading-off price for data quality to achieve fair online allocation M. Molina Nicolas Gast P. Loiseau Vianney Perchet 37 4 0 23 Jun 2023
Online Contextual Decision-Making with a Smart Predict-then-Optimize Method Heyuan Liu Paul Grigas 27 8 0 15 Jun 2022
Fairer LP-based Online Allocation via Analytic Center Guanting Chen Xiaocheng Li Yinyu Ye FaML 23 8 0 27 Oct 2021
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks Xiaocheng Li Chunlin Sun Yinyu Ye 18 21 0 12 Feb 2021
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems S. Balseiro Haihao Lu Vahab Mirrokni 29 101 0 18 Nov 2020