{"total":34,"rows":[{"id":"2106.00661","title":"Reward is enough for convex MDPs","created":"2021-06-01","cited_by_count":84,"area":null},{"id":"2208.13713","title":"Online Bidding Algorithms for Return-on-Spend Constrained Advertisers","created":"2022-08-29","cited_by_count":17,"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":"2210.11834","title":"Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles","created":"2022-10-21","cited_by_count":12,"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":"2501.16046","title":"Revisiting Projection-Free Online Learning with Time-Varying Constraints","created":"2025-01-27","cited_by_count":5,"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":"2505.02963","title":"Single-Sample and Robust Online Resource Allocation","created":"2025-05-05","cited_by_count":3,"area":null},{"id":"2106.07836","title":"Improved Regret Bounds for Online Submodular Maximization","created":"2021-06-15","cited_by_count":2,"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":"2207.04690","title":"Dynamic Budget Throttling in Repeated Second-Price Auctions","created":"2022-07-11","cited_by_count":2,"area":null},{"id":"2301.13791","title":"Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback","created":"2023-01-31","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":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","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":"2109.15015","title":"Robust Allocations with Diversity Constraints","created":"2021-09-30","cited_by_count":1,"area":null},{"id":"2209.12112","title":"Online Allocation and Learning in the Presence of Strategic Agents","created":"2022-09-25","cited_by_count":1,"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.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","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":"2508.16992","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","created":"2025-08-23","cited_by_count":1,"area":null},{"id":"2106.07752","title":"Optimization-friendly generic mechanisms without money","created":"2021-06-14","cited_by_count":0,"area":null},{"id":"2112.14941","title":"A General Traffic Shaping Protocol in E-Commerce","created":"2021-12-30","cited_by_count":0,"area":null},{"id":"2209.08657","title":"Online Regenerative Learning","created":"2022-09-18","cited_by_count":0,"area":null},{"id":"2209.15416","title":"Optimal Efficiency-Envy Trade-Off via Optimal Transport","created":"2022-09-25","cited_by_count":0,"area":null},{"id":"2210.05222","title":"Stochastic Direct Search Method for Blind Resource Allocation","created":"2022-10-11","cited_by_count":0,"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":"2302.05005","title":"Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms","created":"2023-02-10","cited_by_count":0,"area":null},{"id":"2502.05599","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","created":"2025-02-08","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":"2606.18679","title":"Fair Online Resource Allocation","created":"2026-06-17","cited_by_count":0,"area":null}],"next_cursor":null}