Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 5754-5765· 0 citations· 44 references
TL;DR
This work investigates the design of two-stage auctions that allow advertisers to submit and update their bids, with second-stage bids serving as refinements of the initial ones, and proposes a dynamic two-stage auction that adopts realization-dependent entry fees with discounts.
Abstract
To balance prediction accuracy and system latency, large-scale online ad auctions employ two-stage architectures. These systems first retrieve a candidate ads subset using coarse quality metrics before finalizing auction outcomes with refined metrics. However, existing implementations typically elicit user-specific bids only once, overlooking the impact of real-time quality metrics on advertiser valuations and thereby limiting allocation efficiency. Motivated by recent industry practice, we investigate the design of two-stage auctions that allow advertisers to submit and update their bids, with second-stage bids serving as refinements of the initial ones. We derive the incentive-compatible (IC) conditions and analyze the revenue properties of this two-stage auction. Notably, an additional entry fee is required to prevent inflated initial bids, which compromises the standard ex-post individual rationality (IR) property. To address this, we propose a dynamic two-stage auction that adopts realization-dependent entry fees with discounts. By leveraging historical bidding information, our mechanism guarantees approximate ex-ante IC across both stages and restores ex-post IR.
Auto-bidding is now widely adopted in online advertising platforms, allowing advertisers to specify high-level campaign objectives--such as maximizing total value subject to a return-on-spend (ROS) constraint--rather than manual per-query bids. A central question in algorithmic mechanism design is characterizing the wo...
Yang Cai, Vineet Gupta, Yan-Chen Jiang et al.· 1 citation
This work extends the familiar fixed-price eCPM to auction dynamics, allowing unified ranking of fixed-price, auction, and ABIN listings under a single objective, and describes a practical production implementation that approximates this objective, addressing cold-start challenges by bootstrapping from existing engagem...
This paper fully characterize implementable diffusion mechanisms within the combinatorial auction domain for the first time and applies the established theory to design a practical diffusion combinatorial auction, named the Exhausted-Reference Pricing Mechanism, which is incentive-compatible, individually rational, and...
Hao-Tian Zhu, Miao Li, Bin Li et al.· Proceedings of the Thirty-Fi...· 0 citations
The key insight of C3Bid is to leverage channel-wise estimation bias as an explicit coupling mechanism, where campaign-level and channel-level bids are combined through bias-aware weighting to produce the final bid.
Yingjie Chen, Zhuo-Yang Li, Tian-Li Han et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.