Cover Image

A New Benchmark for Online Learning with Budget-Balancing Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Braverman, Mark, Liu, Jingyi, Mao, Jieming, Schneider, Jon, Xue, Eric
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Hardness of Approximate Hylland-Zeckhauser Equilibria
by: Braverman, Mark, et al.
Published: (2026)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
by: Duan, Zhijian, et al.
Published: (2025)

Stronger core results with multidimensional prices
by: Braverman, Mark, et al.
Published: (2026)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
by: Aggarwal, Gagan, et al.
Published: (2024)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
by: Lucier, Brendan, et al.
Published: (2023)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

Learning to Play Against Unknown Opponents
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
by: Wang, Yige, et al.
Published: (2025)

HiBid: A Cross-Channel Constrained Bidding System with Budget Allocation by Hierarchical Offline Deep Reinforcement Learning
by: Wang, Hao, et al.
Published: (2023)

Online Omniprediction with Long-Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

Learning in Budgeted Auctions with Spacing Objectives
by: Fikioris, Giannis, et al.
Published: (2024)

Online Budgeted Matching with General Bids
by: Yang, Jianyi, et al.
Published: (2024)

Distributional Alignment Games for Answer-Level Fine-Tuning
by: Mohri, Mehryar, et al.
Published: (2026)

Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)

Intersectional Fairness in Reinforcement Learning with Large State and Constraint Spaces
by: Eaton, Eric, et al.
Published: (2025)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)

Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)

Feedback Control for Small Budget Pacing
by: Apparaju, Sreeja, et al.
Published: (2025)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

Efficient Opportunistic Approachability
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)

Balancing of competitive two-player Game Levels with Reinforcement Learning
by: Rupp, Florian, et al.
Published: (2023)

Mitigating the Participation Bias by Balancing Extreme Ratings
by: Guo, Yongkang, et al.
Published: (2025)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
by: Lunghi, Anna, et al.
Published: (2025)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Incentivizing Exploration with Selective Data Disclosure
by: Immorlica, Nicole, et al.
Published: (2018)

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

New Adaptive Mechanism for Large Neighborhood Search using Dual Actor-Critic
by: Yu, Shaohua, et al.
Published: (2026)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)