Cover Image

Learning-Augmented Online Bidding in Stochastic Settings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Angelopoulos, Spyros, Simon, Bertrand
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

Generative Bid Shading in Real-Time Bidding Advertising
by: Huang, Yinqiu, et al.
Published: (2025)

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

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

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

Online Causal Inference for Advertising in Real-Time Bidding Auctions
by: Waisman, Caio, et al.
Published: (2019)

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

Learning to Bid in FCR Markets: A Best-of-Both-Worlds Approach
by: Potfer, Marius, et al.
Published: (2026)

Learning to Bid in Non-Stationary Repeated First-Price Auctions
by: Hu, Zihao, et al.
Published: (2025)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)

Generative Auto-Bidding in Large-Scale Competitive Auctions via Diffusion Completer-Aligner
by: Li, Yewen, et al.
Published: (2025)

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

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

Joint Value Estimation and Bidding in Repeated First-Price Auctions
by: Wen, Yuxiao, et al.
Published: (2025)

A Simple, Solid, and Reproducible Baseline for Bridge Bidding AI
by: Kita, Haruka, et al.
Published: (2024)

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

Conjectural Online Learning with First-order Beliefs in Asymmetric Information Stochastic Games
by: Li, Tao, et al.
Published: (2024)

Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
by: Tran, Nam Phuong, et al.
Published: (2024)

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)

Search Games with Predictions
by: Angelopoulos, Spyros, et al.
Published: (2024)

Robust Adversarial Reinforcement Learning in Stochastic Games via Sequence Modeling
by: Tang, Xiaohang, et al.
Published: (2025)

Decentralized Multi-Agent Reinforcement Learning for Continuous-Space Stochastic Games
by: Altabaa, Awni, et al.
Published: (2023)

Deep Reinforcement Learning-Based Bidding Strategies for Prosumers Trading in Double Auction-Based Transactive Energy Market
by: Jiang, Jun, et al.
Published: (2025)

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 for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

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

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
by: Chen, Zaiwei, et al.
Published: (2024)

A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
by: Fan, Zhiyuan, et al.
Published: (2024)

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
by: Xu, Renzhe, et al.
Published: (2024)

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

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

Nash Equilibria via Stochastic Eigendecomposition
by: Gemp, Ian
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)

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

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

On the Universal Near Optimality of Hedge in Combinatorial Settings
by: Fan, Zhiyuan, et al.
Published: (2025)