{"total":22,"rows":[{"id":"2103.10246","title":"Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising","created":"2021-03-16","cited_by_count":25,"area":null},{"id":"2102.12722","title":"Combinatorial Bandits under Strategic Manipulations","created":"2021-02-25","cited_by_count":6,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2306.08470","title":"Bandits with Replenishable Knapsacks: the Best of both Worlds","created":"2023-06-14","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":"2202.13710","title":"Best of Many Worlds Guarantees for Online Learning with Knapsacks","created":"2022-02-28","cited_by_count":4,"area":null},{"id":"2201.07139","title":"Safe Online Bid Optimization with Return on Investment and Budget Constraints","created":"2022-01-18","cited_by_count":3,"area":null},{"id":"2402.19090","title":"Best Arm Identification with Resource Constraints","created":"2024-02-29","cited_by_count":3,"area":null},{"id":"2608.04333","title":"Cost-Aware Multi-Objective Bandits: Theory and Application to Budgeted LLM Configuration Evaluation","created":"2026-08-05","cited_by_count":3,"area":null},{"id":"2102.00321","title":"Recurrent Submodular Welfare and Matroid Blocking Bandits","created":"2021-01-30","cited_by_count":2,"area":null},{"id":"2106.01135","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","created":"2021-06-02","cited_by_count":2,"area":null},{"id":"2409.00561","title":"Multi-Task Combinatorial Bandits for Budget Allocation","created":"2024-08-31","cited_by_count":2,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2502.18826","title":"Adversarial Combinatorial Semi-bandits with Graph Feedback","created":"2025-02-26","cited_by_count":1,"area":null},{"id":"2107.05289","title":"Continuous Time Bandits With Sampling Costs","created":"2021-07-12","cited_by_count":0,"area":null},{"id":"2410.18844","title":"Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints","created":"2024-10-24","cited_by_count":0,"area":null},{"id":"2501.03877","title":"Stochastically Constrained Best Arm Identification with Thompson Sampling","created":"2025-01-07","cited_by_count":0,"area":null},{"id":"2508.20923","title":"Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards","created":"2025-08-28","cited_by_count":0,"area":null},{"id":"2602.24146","title":"Learning with a Budget: Identifying the Best Arm with Resource Constraints","created":"2026-02-27","cited_by_count":0,"area":null},{"id":"2602.24231","title":"Adaptive Combinatorial Experimental Design: Pareto Optimality for Decision-Making and Inference","created":"2026-02-27","cited_by_count":0,"area":null},{"id":"2603.07005","title":"Combinatorial Allocation Bandits with Nonlinear Arm Utility","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2608.16375","title":"Multinomial Subset Routing with Sum-Max Rewards and Operational Constraints","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}