Optimal Calibrated Signaling in Digital Auctions
Zhicheng Du, Wei Tang, Zihe Wang, Shuo Zhang

TL;DR
This paper designs and characterizes optimal calibrated signaling mechanisms in digital ad auctions, enabling platforms to credibly disclose information that maximizes revenue while maintaining truthful bidder estimates.
Contribution
It provides a full characterization and efficient computation of the structure of optimal calibrated signals in second-price auctions, including surplus extraction and approximation algorithms.
Findings
Optimal signaling can extract or exceed full surplus.
The structure of optimal signals is fully characterized and efficiently computable.
An FPTAS is developed for approximate optimal signaling under IR constraints.
Abstract
In digital advertising, online platforms allocate ad impressions through real-time auctions, where advertisers typically rely on autobidding agents to optimize bids on their behalf. Unlike traditional auctions for physical goods, the value of an ad impression is uncertain and depends on the unknown click-through rate (CTR). While platforms can estimate CTRs more accurately using proprietary machine learning algorithms, these estimates/algorithms remain opaque to advertisers. This information asymmetry naturally raises the following questions: how can platforms disclose information in a way that is both credible and revenue-optimal? We address these questions through calibrated signaling, where each prior-free bidder receives a private signal that truthfully reflects the conditional expected CTR of the ad impression. Such signals are trustworthy and allow bidders to form unbiased value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Auction Theory and Applications
