Advancing Ad Auction Realism: Practical Insights & Modeling Implications
Not on the map. Why?
Abstract (arXiv)
Contemporary real-world online ad auctions differ from canonical models [Edelman et al., 2007; Varian, 2009] in at least four ways: (1) values and click-through rates can depend upon users' search queries, but advertisers can only partially "tune" their bids to specific queries; (2) advertisers do not know the number, identity, and precise value distribution of competing bidders; (3) advertisers only receive partial, aggregated feedback, and (4) payment rules are only partially known to bidders. These features make it virtually impossible to fully characterize equilibrium bidding behavior. This paper shows that, nevertheless, one can still gain useful insight into modern ad auctions by modeling advertisers as agents governed by an adversarial bandit algorithm, independent of auction mechanism intricacies. To demonstrate our approach, we first simulate "soft-floor" auctions [Zeithammer, 2019], a complex, real-world pricing rule for which no complete equilibrium characterization is known. We find that (i) when values and click-through rates are query-dependent, soft floors can improve revenues relative to standard auction formats even if bidder types are drawn from the same distribution; and (ii) with distributional asymmetries that reflect relevant real-world scenario, we find that soft floors yield lower revenues than suitably chosen reserve prices, even restricting attention to a single query. We then demonstrate how to infer advertiser value distributions from observed bids for a variety of pricing rules, and illustrate our approach with aggregate data from an e-commerce website.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 43 references that are in the map. First posted on arXiv 21 Jul 2023.
Builds on
16 of 43 references.
References · 16
- 2018Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertisingcited by 61
- 2015Online learning in repeated auctionscited by 39
- 2017Learning to Bid Without Knowing your Valuecited by 34
- 2020Optimal No-regret Learning in Repeated First-price Auctionscited by 33
- 2018Contextual Bandits with Cross-learningcited by 31
- 2020Auction learning as a two-player gamecited by 29
- 2015Econometrics for Learning Agentscited by 23
- 2022Artificial Intelligence and Auction Designcited by 20
- 2020Bayesian Meta-Prior Learning Using Empirical Bayescited by 14
- 2020Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctionscited by 14
- 2023Multi-channel Autobidding with Budget and ROI Constraintscited by 14
- 2019Robust Multi-agent Counterfactual Predictioncited by 6
4 more
- 2021Robust Learning of Optimal Auctionscited by 3
- 2020Using Multi-Agent Reinforcement Learning in Auction Simulationscited by 2
- 2021Equilibria in Auctions With Ad Typescited by 2
- 2020Optimal Bidding Strategy without Exploration in Real-time Biddingcited by 1
Built on by
Not cited yet.