Table of Contents
Fetching ...

Vulnerabilities of Single-Round Incentive Compatibility in Auto-bidding: Theory and Evidence from ROI-Constrained Online Advertising Markets

Juncheng Li, Pingzhong Tang

TL;DR

The paper addresses ROI-constrained auto-bidding markets where platforms control bidding agents and run simultaneous auctions. It develops an auto-bidding equilibrium framework to capture steady-state market behavior under multiplicative pacing and analyzes the computational and practical consequences, revealing $PPAD$-hardness for equilibrium computation and $APX$-hardness for revenue/welfare optimization. It uncovers non-monotonicity and utility instability, demonstrates interference in A/B testing, and argues that first-price auctions can outperform second-price in this context, explaining industry shifts (e.g., Google's partial switch). The findings highlight the limitations of relying on traditional IC results in real-world auto-bidding markets and emphasize the need to consider sub-market structure and practical testing biases for robust auction design. Overall, the work provides both theoretical hardness results and actionable insights for practitioners designing and evaluating auto-bidding-enabled ad markets.

Abstract

Most of the work in the auction design literature assumes that bidders behave rationally based on the information available for every individual auction, and the revelation principle enables designers to restrict their efforts to incentive compatible (IC) mechanisms. However, in today's online advertising markets, one of the most important real-life applications of auction design, the data and computational power required to bid optimally are only available to the platform, and an advertiser can only participate by setting performance objectives and constraints for its proxy auto-bidder provided by the platform. The prevalence of auto-bidding necessitates a review of auction theory. In this paper, we examine the markets through the lens of ROI-constrained value-maximizing campaigns. We show that second price auction exhibits many undesirable properties (computational hardness, non-monotonicity, instability of bidders' utilities, and interference in A/B testing) and loses its dominant theoretical advantages in single-item scenarios. In addition, we make it clear how IC and its runner-up-winner interdependence contribute to each property. We hope that our work could bring new perspectives to the community and benefit practitioners to attain a better grasp of real-world markets.

Vulnerabilities of Single-Round Incentive Compatibility in Auto-bidding: Theory and Evidence from ROI-Constrained Online Advertising Markets

TL;DR

The paper addresses ROI-constrained auto-bidding markets where platforms control bidding agents and run simultaneous auctions. It develops an auto-bidding equilibrium framework to capture steady-state market behavior under multiplicative pacing and analyzes the computational and practical consequences, revealing -hardness for equilibrium computation and -hardness for revenue/welfare optimization. It uncovers non-monotonicity and utility instability, demonstrates interference in A/B testing, and argues that first-price auctions can outperform second-price in this context, explaining industry shifts (e.g., Google's partial switch). The findings highlight the limitations of relying on traditional IC results in real-world auto-bidding markets and emphasize the need to consider sub-market structure and practical testing biases for robust auction design. Overall, the work provides both theoretical hardness results and actionable insights for practitioners designing and evaluating auto-bidding-enabled ad markets.

Abstract

Most of the work in the auction design literature assumes that bidders behave rationally based on the information available for every individual auction, and the revelation principle enables designers to restrict their efforts to incentive compatible (IC) mechanisms. However, in today's online advertising markets, one of the most important real-life applications of auction design, the data and computational power required to bid optimally are only available to the platform, and an advertiser can only participate by setting performance objectives and constraints for its proxy auto-bidder provided by the platform. The prevalence of auto-bidding necessitates a review of auction theory. In this paper, we examine the markets through the lens of ROI-constrained value-maximizing campaigns. We show that second price auction exhibits many undesirable properties (computational hardness, non-monotonicity, instability of bidders' utilities, and interference in A/B testing) and loses its dominant theoretical advantages in single-item scenarios. In addition, we make it clear how IC and its runner-up-winner interdependence contribute to each property. We hope that our work could bring new perspectives to the community and benefit practitioners to attain a better grasp of real-world markets.
Paper Structure (51 sections, 11 theorems, 13 equations, 7 figures, 8 tables)

This paper contains 51 sections, 11 theorems, 13 equations, 7 figures, 8 tables.

Key Result

Proposition 1

Suppose that bidders can bid arbitrarily across auctions. Holding all other bidders' bids, each bidder has a best response wherein bids are generated by scaling its valuations of all goods by a uniform multiplier, given that it could freely choose to win any fraction of a good of which it is a tied

Figures (7)

  • Figure 1: An instance of non-monotonicity.
  • Figure 2: Ad network Blue (left) and Yellow (right) apply different reserve pricing strategies to themselves, respectively.
  • Figure 3: Gap distribution of small instances.
  • Figure 4: Gap distribution of moderate instances.
  • Figure 5: Change of utilities after adding noises. Outliers beyond whiskers are excluded.
  • ...and 2 more figures

Theorems & Definitions (22)

  • Proposition 1
  • Definition 1
  • Theorem 1
  • Theorem 2
  • Theorem 3
  • Definition 2
  • Lemma 1
  • proof
  • proof : Proof of Theorem \ref{['thm:existence']}
  • Lemma 2
  • ...and 12 more