Cover Image

Online Budget Allocation with Censored Semi-Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bachoc, François, Cesa-Bianchi, Nicolò, Cesari, Tommaso, Colomboni, Roberto
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

A Parametric Contextual Online Learning Theory of Brokerage
by: Bachoc, François, et al.
Published: (2024)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
by: Bachoc, François, et al.
Published: (2025)

Trading Volume Maximization with Online Learning
by: Cesari, Tommaso, et al.
Published: (2024)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
Published: (2026)

The Invisible Handshake: Persistent Overpricing by Adaptive Market Agents
by: Foscari, Luigi, et al.
Published: (2025)

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

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

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

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 under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

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

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

Bandits with Preference Feedback: A Stackelberg Game Perspective
by: Pásztor, Barna, et al.
Published: (2024)

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms
by: Khosravi, Khashayar, et al.
Published: (2023)

Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Dynamic Matching Bandit For Two-Sided Online Markets
by: Li, Yuantong, et al.
Published: (2022)

Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)

Online Learning and Equilibrium Computation with Ranking Feedback
by: Liu, Mingyang, et al.
Published: (2026)

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

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)

Incentivized Truthful Communication for Federated Bandits
by: Wei, Zhepei, et al.
Published: (2024)

A Regret Analysis of Bilateral Trade
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)

Incentive-compatible Bandits: Importance Weighting No More
by: Zimmert, Julian, et al.
Published: (2024)

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
by: Hosseini, Hadi, et al.
Published: (2024)

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