{"total":17,"rows":[{"id":"2210.07996","title":"Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions","created":"2022-10-14","cited_by_count":13,"area":null},{"id":"2206.13606","title":"Online Resource Allocation under Horizon Uncertainty","created":"2022-06-27","cited_by_count":9,"area":null},{"id":"2408.00465","title":"Infrequent Resolving Algorithm for Online Linear Programming","created":"2024-08-01","cited_by_count":8,"area":null},{"id":"2110.14621","title":"Fairer LP-based Online Allocation via Analytic Center","created":"2021-10-27","cited_by_count":5,"area":null},{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"area":null},{"id":"2302.02006","title":"Robust Budget Pacing with a Single Sample","created":"2023-02-03","cited_by_count":4,"area":null},{"id":"2501.02761","title":"Beyond $\\mathcal{O}(\\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming","created":"2025-01-06","cited_by_count":4,"area":null},{"id":"2202.06152","title":"Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent","created":"2022-02-12","cited_by_count":3,"area":null},{"id":"2402.07108","title":"Decoupling Learning and Decision-Making: Breaking the $\\mathcal{O}(\\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods","created":"2024-02-11","cited_by_count":3,"area":null},{"id":"2402.13530","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","created":"2024-02-21","cited_by_count":3,"area":null},{"id":"2505.02963","title":"Single-Sample and Robust Online Resource Allocation","created":"2025-05-05","cited_by_count":3,"area":null},{"id":"2606.05606","title":"Cross-Epoch Adaptive Rollout Optimization for RL Post-Training","created":"2026-06-04","cited_by_count":2,"area":null},{"id":"2401.01077","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","created":"2024-01-02","cited_by_count":1,"area":null},{"id":"2112.13964","title":"Online Allocation Problem with Two-sided Resource Constraints","created":"2021-12-28","cited_by_count":0,"area":null},{"id":"2302.00997","title":"Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning","created":"2023-02-02","cited_by_count":0,"area":null},{"id":"2302.05005","title":"Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms","created":"2023-02-10","cited_by_count":0,"area":null},{"id":"2505.12037","title":"Adaptive Resolving Methods for Markov Decision Processes with Function Approximations","created":"2025-05-17","cited_by_count":0,"area":null}],"next_cursor":null}