JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing
Linghui Meng, Chun Gan, Shengsheng Niu, Chengcheng Zhang, Chenchen Li, Chuan Yang, Yi Mao, Xin Zhu, Jie He, Zhangang Lin, Ching Law

TL;DR
JD-BP is a novel joint generative framework that optimizes auto-bidding and pricing strategies simultaneously, improving ad revenue and cost efficiency in online advertising.
Contribution
It introduces a joint decision model with a memory-less return-to-go, trajectory augmentation, and energy-based preference optimization for better bidding and pricing.
Findings
Achieves state-of-the-art offline performance on AuctionNet dataset.
Online A/B tests show 4.70% revenue increase and 6.48% cost improvement.
Effectively integrates bidding and pricing in a plug-and-play manner.
Abstract
Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget. However, uncertainties such as model prediction errors and feedback latency can cause bidding strategies to deviate from ex-post optimality, leading to inefficient allocation. To address this issue, we propose JD-BP, a Joint generative Decision framework for Bidding and Pricing. Unlike prior methods, JD-BP jointly outputs a bid value and a pricing correction term that acts additively with the payment rule such as GSP. To mitigate adverse effects of historical constraint violations, we design a memory-less Return-to-Go that encourages future value maximizing of bidding actions while the cumulated bias is handled by the pricing correction. Moreover, a trajectory augmentation algorithm is proposed to generate joint…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
