Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice
Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni
摘要
Online advertising channels commonly focus on maximizing total advertiser welfare to enhance channel health, and previous literature has studied augmenting ad auctions with machine learning predictions on advertiser values (also known asmachine-learned advice ) to improve total welfare. Yet, such improvements could come at the cost of individual bidders' welfare and do not shed light on how particular advertiser bidding strategies impact welfare. Motivated by this, we present an analysis on an individual bidder's welfare loss in the autobidding world for auctions with and without machine-learned advice, and also uncover how advertiser strategies relate to such losses. In particular, we demonstrate how ad platforms can utilize ML advice to improve welfare guarantee on the aggregate and individual bidder level by setting ML advice as personalized reserve prices when the platform consists ofautobidders who maximize value while respecting a return on ad spend (ROAS) constraint. Under parallel VCG auctions with such ML advice-based reserves, we present a worst-case welfare lower-bound guarantee for an individual autobidder, and show that the lower-bound guarantee is positively correlated with ML advice quality as well as the scale of bids induced by the autobidder's bidding strategies. Further, we show that no truthful, and possibly randomized mechanism with anonymous allocations can achieve universally better individual welfare guarantees than VCG, in the presence of personalized reserves based on ML-advice of equal quality. Moreover, we extend our individual welfare guarantee results to generalized first price (GFP) and generalized second price (GSP) auctions. Finally, we present numerical studies using semi-synthetic data derived from ad auction logs of a search ad platform to showcase improvements in individual welfare when setting personalized reserve prices with ML-advice.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Interpolating Item and User Fairness in Multi-Sided RecommendationsQinyi Chen, Jason Cheuk Nam Liang, Negin Golrezaei, Djallel BouneffoufNeurIPS 2024 · 被引用 8 次
- Online Bidding under RoS Constraints without Knowing the ValueSushant Vijayan, Zhe Feng, Swati Padmanabhan, Karthikeyan Shanmugam 等WWW 2025 · 被引用 4 次
- Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed RewardsYuwei Cheng, Zifeng Zhao, Haifeng XuNeurIPS 2025
- Optimal Contest beyond ConvexityNegin Golrezaei, MohammadTaghi Hajiaghayi, Suho ShinSTOC 2026
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price AuctionsNegin Golrezaei, Sourav SahooICML 2025
它引用的顶会 Paper9
- CoinDICE: Off-Policy Confidence Interval EstimationBo Dai, Ofir Nachum, Yinlam Chow, Lihong Li 等NeurIPS 2020 · 被引用 96 次
- Robust Auction Design in the Auto-bidding WorldSantiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni 等NeurIPS 2021 · 被引用 95 次
- Towards Efficient Auctions in an Auto-bidding WorldYuan Deng, Jieming Mao, Vahab S. Mirrokni, Song ZuoWWW 2021 · 被引用 87 次
- Online Algorithms for Multi-shop Ski Rental with Machine Learned AdviceShufan Wang, Jian Li, Shiqiang WangNeurIPS 2020 · 被引用 60 次
- Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCGAranyak MehtaWWW 2022 · 被引用 41 次
相关 Paper
- No-Regret Algorithms in non-Truthful Auctions with Budget and ROI ConstraintsGagan Aggarwal, Giannis Fikioris, Mingfei ZhaoWWW 2025 · 被引用 13 次
- Efficiency of the First-Price Auction in the Autobidding WorldYuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang 等NeurIPS 2024 · 被引用 1 次
- Model Monotonicity in Autobidding Auctions: When Do Better Predictions Lead to Better Outcomes?Ashwinkumar BadanidiyuruICML 2026
- No-Regret Online Autobidding Algorithms in First-price AuctionsYilin Li, Yuan Deng, Wei Tang, Hanrui ZhangNeurIPS 2025 · 被引用 4 次
- Efficiency of Non-Truthful Auctions in Auto-bidding with Budget ConstraintsChristopher Liaw, Aranyak Mehta, Wennan ZhuWWW 2024 · 被引用 10 次
