An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions
Tian Zhou, Hao He, Shengjun Pan, Niklas Karlsson, Bharatbhushan, Shetty, Brendan Kitts, Djordje Gligorijevic, San Gultekin, Tingyu Mao, Junwei, Pan, Jianlong Zhang, Aaron Flores

TL;DR
This paper presents a deep distribution network for optimal bid shading in first-price auctions, significantly improving advertiser ROI and outperforming previous algorithms in both offline and live online advertising environments.
Contribution
The paper introduces a novel deep distribution network tailored for bid shading in first-price auctions, optimized for both open and censored data, and successfully deployed in a major DSP.
Findings
Outperforms previous algorithms in surplus and eCPX metrics.
Deployed in VerizonMedia DSP serving hundreds of billions of bids daily.
Online A/B tests show ROI improvements of up to 8.6%."
Abstract
Since 2019, most ad exchanges and sell-side platforms (SSPs), in the online advertising industry, shifted from second to first price auctions. Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had to update their bidding strategies to avoid bidding unnecessarily high and hence overpaying. Bid shading was proposed to adjust the bid price intended for second-price auctions, in order to balance cost and winning probability in a first-price auction setup. In this study, we introduce a novel deep distribution network for optimal bidding in both open (non-censored) and closed (censored) online first-price auctions. Offline and online A/B testing results show that our algorithm outperforms previous state-of-art algorithms in terms of both surplus and effective cost per action (eCPX) metrics. Furthermore, the algorithm is optimized in run-time and has…
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.
