{"total":25,"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":"2310.18304","title":"A Stability Principle for Learning under Non-Stationarity","created":"2023-10-27","cited_by_count":10,"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":"2503.07324","title":"Decision-Dependent Stochastic Optimization: The Role of Distribution Dynamics","created":"2025-03-10","cited_by_count":6,"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":"2309.09411","title":"Distributionally Time-Varying Online Stochastic Optimization under Polyak-{\\L}ojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning","created":"2023-09-18","cited_by_count":3,"area":null},{"id":"2311.01327","title":"High-dimensional Linear Bandits with Knapsacks","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2404.02988","title":"Risk-averse Learning with Non-Stationary Distributions","created":"2024-04-03","cited_by_count":2,"area":null},{"id":"2502.15345","title":"Efficiently Solving Discounted MDPs with Predictions on Transition Matrices","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2212.01689","title":"Learning-Assisted Algorithm Unrolling for Online Optimization with Budget Constraints","created":"2022-12-03","cited_by_count":1,"area":null},{"id":"2303.03254","title":"An Online Algorithm for Chance Constrained Resource Allocation","created":"2023-03-06","cited_by_count":1,"area":null},{"id":"2305.10744","title":"Online Resource Allocation in Episodic Markov Decision Processes","created":"2023-05-18","cited_by_count":1,"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":"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":"2609.00662","title":"Drift-Aware LLM Routing with Sparse Contexts and Shared Budgets","created":"2026-09-01","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":"2505.02796","title":"Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationarity","created":"2025-05-05","cited_by_count":0,"area":null},{"id":"2512.11131","title":"Fairness-Regularized Online Optimization with Switching Costs","created":"2025-12-11","cited_by_count":0,"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":"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":"2610.09577","title":"Online Resource Allocation with an Endogenous Markov State: Fewer LP Solves Earn More","created":"2026-10-07","cited_by_count":0,"area":null}],"next_cursor":null}