:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Apparaju, Sreeja, Niu, Yichuan, Qi, Xixi
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2509.25429
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Smart Fast Finish: Preventing Overdelivery via Daily Budget Pacing at DoorDash
by: Garg, Rohan, et al.
Published: (2025)

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

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

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

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

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

A Lightweight MPC Bidding Framework for Brand Auction Ads
by: Chen, Yuanlong, et al.
Published: (2026)

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

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

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

A Practical Guide to Budget Pacing Algorithms in Digital Advertising
by: Chen, Yuanlong
Published: (2025)

Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence
by: Gaitonde, Jason, et al.
Published: (2022)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
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)

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

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

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

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

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

Attacking and Securing Community Detection: A Game-Theoretic Framework
by: Niu, Yifan, 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)

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

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)

Online Stackelberg Optimization via Nonlinear Control
by: Brown, William, et al.
Published: (2024)

Axioms for AI Alignment from Human Feedback
by: Ge, Luise, et al.
Published: (2024)

Zeroth-Order Stackelberg Control in Combinatorial Congestion Games
by: Masiha, Saeed, et al.
Published: (2026)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)

Efficient Ensemble Selection from Binary and Pairwise Feedback
by: Neoh, Tzeh Yuan, et al.
Published: (2026)

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

Learning Aggregation Rules in Participatory Budgeting: A Data-Driven Approach
by: Fairstein, Roy, et al.
Published: (2024)

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching
by: Shi, Zhekun, et al.
Published: (2025)

Proper Dataset Valuation by Pointwise Mutual Information
by: Zheng, Shuran, et al.
Published: (2024)

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

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

RLRF: Competitive Search Agent Design via Reinforcement Learning from Ranker Feedback
by: Mordo, Tommy, et al.
Published: (2025)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
by: Jordan, Michael I., et al.
Published: (2023)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
by: Sharma, Vedansh
Published: (2025)