{"total":13,"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":"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.14621","title":"Fairer LP-based Online Allocation via Analytic Center","created":"2021-10-27","cited_by_count":5,"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":"2412.10168","title":"Learning payoffs while routing in skill-based queues","created":"2024-12-13","cited_by_count":2,"area":null},{"id":"2603.14673","title":"A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming","created":"2026-03-15","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}],"next_cursor":null}