{"total":31,"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.07316","title":"Online Contextual Decision-Making with a Smart Predict-then-Optimize Method","created":"2022-06-15","cited_by_count":12,"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":"2203.17150","title":"Online Learning for Traffic Routing under Unknown Preferences","created":"2022-03-31","cited_by_count":4,"area":null},{"id":"2306.07709","title":"Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets","created":"2023-06-13","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":"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":"2205.00825","title":"Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements","created":"2022-04-27","cited_by_count":2,"area":null},{"id":"2306.13440","title":"Trading-off price for data quality to achieve fair online allocation","created":"2023-06-23","cited_by_count":2,"area":null},{"id":"2511.07604","title":"Infinite-Dimensional Operator/Block Kaczmarz Algorithms: Regret Bounds and $\\lambda$-Effectiveness","created":"2025-11-10","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":"2303.03254","title":"An Online Algorithm for Chance Constrained Resource Allocation","created":"2023-03-06","cited_by_count":1,"area":null},{"id":"2303.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2412.09594","title":"Wait-Less Offline Tuning and Re-solving for Online Decision Making","created":"2024-12-12","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":"2112.13964","title":"Online Allocation Problem with Two-sided Resource Constraints","created":"2021-12-28","cited_by_count":0,"area":null},{"id":"2209.08657","title":"Online Regenerative Learning","created":"2022-09-18","cited_by_count":0,"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":"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":"2608.04669","title":"Differentiating Through Dual Prices: End-to-End Policy Learning Under Capacity Constraints","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2608.14096","title":"Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand","created":"2026-08-14","cited_by_count":0,"area":null},{"id":"2608.18503","title":"LLM-Powered Predictive Decision-Making for Sustainable Data Center Operations","created":"2026-08-19","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},{"id":"2610.15043","title":"Information-Theoretic Foundations of Online Temperature Sampling","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}