{"total":19,"rows":[{"id":"2102.06385","title":"The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks","created":"2021-02-12","cited_by_count":16,"area":null},{"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":"2505.21692","title":"What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization","created":"2025-05-27","cited_by_count":9,"area":null},{"id":"2209.00399","title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","created":"2022-09-01","cited_by_count":8,"area":null},{"id":"2408.00465","title":"Infrequent Resolving Algorithm for Online Linear Programming","created":"2024-08-01","cited_by_count":8,"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":"2211.13952","title":"Contextual Decision-Making with Knapsacks Beyond the Worst Case","created":"2022-11-25","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":"2205.00825","title":"Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements","created":"2022-04-27","cited_by_count":2,"area":null},{"id":"2207.04690","title":"Dynamic Budget Throttling in Repeated Second-Price Auctions","created":"2022-07-11","cited_by_count":2,"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":"2602.18114","title":"Non-Stationary Online Resource Allocation: Learning from a Single Sample","created":"2026-02-20","cited_by_count":1,"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":"2607.02150","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","created":"2026-07-02","cited_by_count":0,"area":null},{"id":"2608.11383","title":"Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}