{"total":52,"rows":[{"id":"2208.13713","title":"Online Bidding Algorithms for Return-on-Spend Constrained Advertisers","created":"2022-08-29","cited_by_count":17,"area":null},{"id":"2404.09832","title":"No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints","created":"2024-04-15","cited_by_count":9,"area":null},{"id":"2104.09750","title":"Joint Online Learning and Decision-making via Dual Mirror Descent","created":"2021-04-20","cited_by_count":8,"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":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","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.05881","title":"Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets","created":"2022-02-04","cited_by_count":4,"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":"2407.00575","title":"Learning to Control Unknown Strongly Monotone Games","created":"2024-06-30","cited_by_count":4,"area":null},{"id":"2410.17336","title":"Computing Optimal Regularizers for Online Linear Optimization","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2605.09749","title":"Primal-Dual Guided Decoding for Constrained Discrete Diffusion","created":"2026-05-10","cited_by_count":4,"area":"diffusion"},{"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":"2202.06152","title":"Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent","created":"2022-02-12","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":"2503.14796","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","created":"2025-03-19","cited_by_count":3,"area":null},{"id":"2602.08878","title":"Learning Potentials for Dynamic Matching and Application to Heart Transplantation","created":"2026-02-09","cited_by_count":3,"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":"2109.03467","title":"A Deep Reinforcement Learning Approach for Online Parcel Assignment","created":"2021-09-08","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":"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":"2506.23090","title":"Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems","created":"2025-06-29","cited_by_count":2,"area":"offlinerl"},{"id":"2606.05606","title":"Cross-Epoch Adaptive Rollout Optimization for RL Post-Training","created":"2026-06-04","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":"2406.01939","title":"Speeding up Policy Simulation in Supply Chain RL","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2502.15451","title":"Binary-Integer-Programming Based Algorithm for Expert Load Balancing in Mixture-of-Experts Models","created":"2025-02-21","cited_by_count":1,"area":"moe"},{"id":"2512.03915","title":"A Theoretical Framework for Auxiliary-Loss-Free Load Balancing of Sparse Mixture-of-Experts in Large-Scale AI Models","created":"2025-12-03","cited_by_count":1,"area":"moe"},{"id":"2606.15841","title":"Heteroskedastic Signals in Budgeted LLM Verification: Structural Heterogeneity Limits Optimization Gains","created":"2026-06-14","cited_by_count":1,"area":null},{"id":"2104.12828","title":"Multi-resource allocation for federated settings: A non-homogeneous Markov chain model","created":"2021-04-26","cited_by_count":0,"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":"2402.03388","title":"Delivery Optimized Discovery in Behavioral User Segmentation under Budget Constraint","created":"2024-02-04","cited_by_count":0,"area":null},{"id":"2409.03874","title":"Cost-Control in Display Advertising: Theory vs Practice","created":"2024-09-05","cited_by_count":0,"area":null},{"id":"2412.03983","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","created":"2024-12-05","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":"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":"2508.14311","title":"Online Learning with Multiple Fairness Regularizers via Graph-Structured Feedback","created":"2025-08-19","cited_by_count":0,"area":null},{"id":"2509.16324","title":"Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2601.20694","title":"Is Pure Exploitation Sufficient in Exogenous MDPs with Linear Function Approximation?","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2602.02943","title":"3D-Learning: Diffusion-Augmented Distributionally Robust Decision-Focused Learning","created":"2026-02-03","cited_by_count":0,"area":"diffusion"},{"id":"2605.10475","title":"Regret Minimization in Bilateral Trade With Perturbed Markets","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.27999","title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints","created":"2026-05-27","cited_by_count":0,"area":"agents"},{"id":"2605.28133","title":"Learning to Bid in Repeated Second-Price Auctions with Dynamic Values and Aggregated Feedback","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.18679","title":"Fair Online Resource Allocation","created":"2026-06-17","cited_by_count":0,"area":null},{"id":"2607.16891","title":"Certified-Gap Dual-Price Policies for Real-Time Truckload Bid Acceptance with Relocating, Clock-Constrained Resources","created":"2026-07-18","cited_by_count":0,"area":null},{"id":"2607.19357","title":"Stochastic Primal-Dual Decoding for Multiobjective Generative Recommender Systems","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2607.22935","title":"Discrepancy-Rounded Fair Bandits with Static and Time-Varying Exposure Floors","created":"2026-07-24","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":"2609.40070","title":"Inference Auctions","created":"2026-09-30","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}