{"total":16,"rows":[{"id":"2207.06272","title":"Hindsight Learning for MDPs with Exogenous Inputs","created":"2022-07-13","cited_by_count":26,"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":"2408.00465","title":"Infrequent Resolving Algorithm for Online Linear Programming","created":"2024-08-01","cited_by_count":8,"area":null},{"id":"2111.10285","title":"Adversarial Deep Learning for Online Resource Allocation","created":"2021-11-19","cited_by_count":7,"area":null},{"id":"2306.07106","title":"Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement Learning","created":"2023-06-12","cited_by_count":7,"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":"2502.06168","title":"Dynamic Pricing with Adversarially-Censored Demands","created":"2025-02-10","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":"2311.00181","title":"Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization","created":"2023-10-31","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":"2602.18114","title":"Non-Stationary Online Resource Allocation: Learning from a Single Sample","created":"2026-02-20","cited_by_count":1,"area":null},{"id":"2604.09423","title":"Offline Local Search for Online Stochastic Bandits","created":"2026-04-10","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},{"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}],"next_cursor":null}