Two-Stage Auctions with Bid Refinement for Online Advertising
Yidan Xing, Rui Guo, Yixin Tao, Dagui Chen, Zhenzhe Zheng, Jian Xu, Fan Wu
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on7
- On Component Interactions in Two-Stage Recommender SystemsJiri Hron, Karl Krauth, Michael I. Jordan, Niki KilbertusNeurIPS 2021 · 39 citations
- On Designing a Two-stage Auction for Online AdvertisingYiqing Wang, Xiangyu Liu, Zhenzhe Zheng, Zhilin Zhang et al.WWW 2022 · 19 citations
- Bidder Subset Selection Problem in Auction DesignXiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin TangSODA 2023 · 5 citations
- Eligibility Mechanisms: Auctions Meet Information RetrievalGagan Goel, Renato Paes Leme, Jon Schneider, David Thompson et al.WWW 2023 · 5 citations
- Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson ApproximationNikolai Gravin, Yixuan Even Xu, Renfei ZhouWWW 2024 · 3 citations
Related papers
- Truthful Bandit Mechanisms for Repeated Two-stage Ad AuctionsHaoming Li, Yumou Liu, Zhenzhe Zheng, Zhilin Zhang et al.KDD 2024 · 1 citation
- Two-stage Auction Design in Online AdvertisingZhikang Fan, Lan Hu, Ruirui Wang, Zhongrui Ma et al.WWW 2025 · 2 citations
- A Data-Driven Metric of Incentive CompatibilityYuan Deng, Sébastien Lahaie, Vahab S. Mirrokni, Song ZuoWWW 2020 · 18 citations
- Simultaneous Optimization of Bid Shading and Internal Auction for Demand-Side PlatformsYadong Xu, Bonan Ni, Weiran Shen, Xun Wang et al.AAAI 2024 · 1 citation
- Risk-Averse and Optimistic Advertiser Incentive Compatibility in Auto-biddingChristopher Liaw, Wennan ZhuICML 2026 · 1 citation
