Table of Contents
Fetching ...

IC Mechanisms for Risk-Averse Advertisers in the Online Advertising System

Bingzhe Wang, Ruohan Qian, Yuejia Dou, Qi Qi, Bo Shen, Changyuan Li, Yixuan Zhang, Yixin Su, Xin Yuan, Wenqiang liu, Bin Zou, Wen Yi, Zhi Guo, Shuanglong Li, Liu Lin

TL;DR

Decoupled First-Price Auction (DFP) is proposed, a mechanism that retains its IC property even during runtime, and dynamically adjusts the payment based on real-time user conversion outcomes, ensuring that advertisers' realized utilities closely approximate their expected utilities during runtime.

Abstract

The autobidding system generates huge revenue for advertising platforms, garnering substantial research attention. Existing studies in autobidding systems focus on designing Autobidding Incentive Compatible (AIC) mechanisms, where the mechanism is Incentive Compatible (IC) under ex ante expectations. However, upon deploying AIC mechanisms in advertising platforms, we observe a notable deviation between the actual auction outcomes and these expectations during runtime, particularly in the scene with few clicks (sparse-click). This discrepancy undermines truthful bidding among advertisers in AIC mechanisms, especially for risk-averse advertisers who are averse to outcomes that do not align with the expectations. To address this issue, we propose a mechanism, Decoupled First-Price Auction (DFP), that retains its IC property even during runtime. DFP dynamically adjusts the payment based on real-time user conversion outcomes, ensuring that advertisers' realized utilities closely approximate their expected utilities during runtime. To realize the payment mechanism of DFP, we propose a PPO-based RL algorithm, with a meticulously crafted reward function. This algorithm dynamically adjusts the payment to fit DFP mechanism. We conduct extensive experiments leveraging real-world data to validate our findings.

IC Mechanisms for Risk-Averse Advertisers in the Online Advertising System

TL;DR

Decoupled First-Price Auction (DFP) is proposed, a mechanism that retains its IC property even during runtime, and dynamically adjusts the payment based on real-time user conversion outcomes, ensuring that advertisers' realized utilities closely approximate their expected utilities during runtime.

Abstract

The autobidding system generates huge revenue for advertising platforms, garnering substantial research attention. Existing studies in autobidding systems focus on designing Autobidding Incentive Compatible (AIC) mechanisms, where the mechanism is Incentive Compatible (IC) under ex ante expectations. However, upon deploying AIC mechanisms in advertising platforms, we observe a notable deviation between the actual auction outcomes and these expectations during runtime, particularly in the scene with few clicks (sparse-click). This discrepancy undermines truthful bidding among advertisers in AIC mechanisms, especially for risk-averse advertisers who are averse to outcomes that do not align with the expectations. To address this issue, we propose a mechanism, Decoupled First-Price Auction (DFP), that retains its IC property even during runtime. DFP dynamically adjusts the payment based on real-time user conversion outcomes, ensuring that advertisers' realized utilities closely approximate their expected utilities during runtime. To realize the payment mechanism of DFP, we propose a PPO-based RL algorithm, with a meticulously crafted reward function. This algorithm dynamically adjusts the payment to fit DFP mechanism. We conduct extensive experiments leveraging real-world data to validate our findings.

Paper Structure

This paper contains 30 sections, 8 theorems, 37 equations, 7 figures, 1 table.

Key Result

Lemma 1

In CFP, the optimal bidding strategy for tCPA bidder $m$ is $b_{m}^{*} = tCPA_{m}$. Furthermore, if all bidders are tCPA bidders, then the strategy $b_{m}^{*} = tCPA_{m}$ constitutes a Nash Equilibrium (NE).

Figures (7)

  • Figure 1: The Conversion Volume of an Advertiser
  • Figure 2: Decoupled First-Price Auction
  • Figure 3: The $\frac{tCPA}{CPA}$ ratio of 5000 bidders over 31 days.
  • Figure 4: Comparison between CFP and DFP.
  • Figure 5: The $\frac{tCPA}{CPA}$ ratio of a bidder with an average daily click volume of 132.
  • ...and 2 more figures

Theorems & Definitions (23)

  • Definition 1: Value-Maximizer
  • Definition 2: Autobidding Incentive Compatibility (AIC)alimohammadi2023incentive
  • Definition 3: Individual Rationality (IR)
  • Definition 4: Coupled First-Price Auction (CFP)
  • Lemma 1
  • Theorem 1
  • Lemma 2
  • Definition 5: Risk-Averse Bidder
  • Lemma 3
  • Definition 6: Time-Invariant Incentive Compatibility (TIC)
  • ...and 13 more