Lightweight Auto-bidding based on Traffic Prediction in Live Advertising
- URL: http://arxiv.org/abs/2508.06069v1
- Date: Fri, 08 Aug 2025 07:05:35 GMT
- Title: Lightweight Auto-bidding based on Traffic Prediction in Live Advertising
- Authors: Bo Yang, Ruixuan Luo, Junqi Jin, Han Zhu,
- Abstract summary: We propose a lightweight bidding algorithm Binary Constrained Bidding (BiCB)<n>BiCB neatly combines the optimal bidding formula given by mathematical analysis and the statistical method of future traffic estimation.<n>Sufficient offline and online experiments prove BiCB's good performance and low engineering cost.
- Score: 12.578089904793638
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Internet live streaming is widely used in online entertainment and e-commerce, where live advertising is an important marketing tool for anchors. An advertising campaign hopes to maximize the effect (such as conversions) under constraints (such as budget and cost-per-click). The mainstream control of campaigns is auto-bidding, where the performance depends on the decision of the bidding algorithm in each request. The most widely used auto-bidding algorithms include Proportional-Integral-Derivative (PID) control, linear programming (LP), reinforcement learning (RL), etc. Existing methods either do not consider the entire time traffic, or have too high computational complexity. In this paper, the live advertising has high requirements for real-time bidding (second-level control) and faces the difficulty of unknown future traffic. Therefore, we propose a lightweight bidding algorithm Binary Constrained Bidding (BiCB), which neatly combines the optimal bidding formula given by mathematical analysis and the statistical method of future traffic estimation, and obtains good approximation to the optimal result through a low complexity solution. In addition, we complement the form of upper and lower bound constraints for traditional auto-bidding modeling and give theoretical analysis of BiCB. Sufficient offline and online experiments prove BiCB's good performance and low engineering cost.
Related papers
- Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms [71.47275796833235]
We present a standardized and transparent evaluation protocol for comparing classical and reinforcement learning autobidding algorithms.<n>We utilize the most recent open-source environment developed in the industry, which accurately emulates the bidding process.
arXiv Detail & Related papers (2025-10-22T08:27:56Z) - HOB: A Holistically Optimized Bidding Strategy under Heterogeneous Auction Mechanisms with Organic Traffic [23.230940625345372]
E-commerce advertising platforms typically sell commercial traffic through either second-price auction (SPA) or first-price auction (FPA)<n>For automated bidding systems, such a trend poses a critical challenge: determining optimal strategies across heterogeneous auction channels to fulfill diverse advertiser objectives.<n>We derive an efficient solution for optimal bidding under FPA channels, which takes into account the presence of organic traffic - traffic can be won for free.
arXiv Detail & Related papers (2025-10-17T02:00:09Z) - Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems [54.709976343045824]
Current offline reinforcement learning (RL) methods face substantial challenges when applied to sparse advertising scenarios.<n>We propose MTORL, a novel multi-task offline RL model that targets two key objectives.<n>We employ multi-task learning to decode actions and rewards, simultaneously addressing channel recommendation and budget allocation.
arXiv Detail & Related papers (2025-06-29T05:05:13Z) - BAT: Benchmark for Auto-bidding Task [67.56067222427946]
We present an auction benchmark encompassing the two most prevalent auction formats.<n>We implement a series of robust baselines on a novel dataset.<n>This benchmark provides a user-friendly and intuitive framework for researchers and practitioners to develop and refine innovative autobidding algorithms.
arXiv Detail & Related papers (2025-05-13T12:12:34Z) - Nash Equilibrium Constrained Auto-bidding With Bi-level Reinforcement Learning [64.2367385090879]
We propose a new formulation of the auto-bidding problem from the platform's perspective.<n>It aims to maximize the social welfare of all advertisers under the $epsilon$-NE constraint.<n>The NCB problem presents significant challenges due to its constrained bi-level structure and the typically large number of advertisers involved.
arXiv Detail & Related papers (2025-03-13T12:25:36Z) - Auto-bidding in real-time auctions via Oracle Imitation Learning (OIL) [9.19703820485146]
We propose a framework for training auto-bidding agents in multi-slot second-price auctions.<n>We exploit the insight that, after an advertisement campaign concludes, determining the optimal bids for each impression opportunity can be framed as a multiple-choice knapsack problem.<n>We propose an "oracle" algorithm that identifies a near-optimal combination of impression opportunities and advertisement slots.
arXiv Detail & Related papers (2024-12-16T04:21:35Z) - Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs.
Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
arXiv Detail & Related papers (2024-11-20T18:06:55Z) - Bayesian Optimization and Deep Learning forsteering wheel angle
prediction [58.720142291102135]
This work aims to obtain an accurate model for the prediction of the steering angle in an automated driving system.
BO was able to identify, within a limited number of trials, a model -- namely BOST-LSTM -- which resulted, the most accurate when compared to classical end-to-end driving models.
arXiv Detail & Related papers (2021-10-22T15:25:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.