{"total":18,"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":"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":"2110.10081","title":"Stateful Offline Contextual Policy Evaluation and Learning","created":"2021-10-19","cited_by_count":6,"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":"2501.18049","title":"Online Pricing and Allocation with Demand Learning and Fulfillment Cost","created":"2025-01-29","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":"2501.14155","title":"Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices","created":"2025-01-24","cited_by_count":3,"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":"2404.04467","title":"Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management","created":"2024-04-06","cited_by_count":2,"area":null},{"id":"2407.05564","title":"A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints","created":"2024-07-08","cited_by_count":1,"area":null},{"id":"2507.06859","title":"Episodic Contextual Bandits with Knapsacks under Conversion Models","created":"2025-07-09","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":"2505.12037","title":"Adaptive Resolving Methods for Markov Decision Processes with Function Approximations","created":"2025-05-17","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":"2609.05895","title":"A First-Order Learning Algorithm for Online Resource Allocation with Constant Regret","created":"2026-09-05","cited_by_count":0,"area":null},{"id":"2609.28263","title":"Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving","created":"2026-09-23","cited_by_count":0,"area":null}],"next_cursor":null}