The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
Yuxiao Wen, Zihao Hu, Yanjun Han, Yuan YAO, Zhengyuan Zhou
Abstract
Existing auto-bidding algorithms in digital advertising often treat the value of an ad opportunity as the revenue obtained when an ad is shown and/or clicked, and bid accordingly. This can lead to wasteful spending because the true value is the marginal gain from paid exposure: even without winning a sponsored slot, an advertiser may still earn revenue via an organic search result (e.g., on Google or Amazon). Motivated by recent work, we model ad value as a treatment effect—the outcome difference between winning and losing the auction—and study online learning for bidding in second-price (Vickrey) auctions under this causal perspective. We develop algorithms that attain rate-optimal regret under several feedback models. A key ingredient exploits the information revealed by the second-price payment rule, which strictly improves regret relative to analogous learning problems in first-price auctions.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f6c576be-35c6-437f-9c8b-a6d8b6560258Builds on5
- Learning to Bid in Contextual First Price Auctions✱Ashwinkumar Badanidiyuru, Zhe Feng, Guru GuruganeshWWW 2023 · 24 citations
- Causal Models for Real Time Bidding with Repeated User InteractionsMartin Bompaire, Alexandre Gilotte, Benjamin HeymannKDD 2021 · 10 citations
- Incrementality Bidding via Reinforcement Learning under Mixed and Delayed RewardsAshwinkumar Badanidiyuru Varadaraja, Zhe Feng, Tianxi Li, Haifeng XuNeurIPS 2022 · 7 citations
- The Role of Transparency in Repeated First-Price Auctions with Unknown ValuationsNicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco et al.STOC 2024 · 6 citations
- Stochastic contextual bandits with graph feedback: from independence number to MAS numberYuxiao Wen, Yanjun Han, Zhengyuan ZhouNeurIPS 2024 · 6 citations
Related papers
- Improved Online Learning Algorithms for CTR Prediction in Ad AuctionsZhe Feng, Christopher Liaw, Zixin ZhouICML 2023 · 9 citations
- Learning to Bid in Repeated First-Price Auctions with BudgetsQian Wang, Zongjun Yang, Xiaotie Deng, Yuqing KongICML 2023 · 24 citations
- No-Regret Algorithms in non-Truthful Auctions with Budget and ROI ConstraintsGagan Aggarwal, Giannis Fikioris, Mingfei ZhaoWWW 2025 · 13 citations
- Auctions between Regret-Minimizing AgentsYoav Kolumbus, Noam NisanWWW 2022 · 47 citations
- No-Regret Online Autobidding Algorithms in First-price AuctionsYilin Li, Yuan Deng, Wei Tang, Hanrui ZhangNeurIPS 2025 · 4 citations
