IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2507.17187.html
   My bibliography  Save this paper

Optimal Calibrated Signaling in Digital Auctions

Author

Listed:
  • Zhicheng Du
  • Wei Tang
  • Zihe Wang
  • Shuo Zhang

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 estimates, even without access to the platform's internal algorithms. We study the design of platform-optimal calibrated signaling in the context of second-price auction. Our first main result fully characterizes the structure of the optimal calibrated signaling, which can also be computed efficiently. We show that this signaling can extract the full surplus -- or even exceed it -- depending on a specific market condition. Our second main result is an FPTAS for computing an approximately optimal calibrated signaling that satisfies an IR condition. Our main technical contributions are: a reformulation of the platform's problem as a two-stage optimization problem that involves optimal transport subject to calibration feasibility constraints on the bidders' marginal bid distributions; and a novel correlation plan that constructs the optimal distribution over second-highest bids.

Suggested Citation

  • Zhicheng Du & Wei Tang & Zihe Wang & Shuo Zhang, 2025. "Optimal Calibrated Signaling in Digital Auctions," Papers 2507.17187, arXiv.org.
  • Handle: RePEc:arx:papers:2507.17187
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2507.17187
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    2. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2017. "First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue," Econometrica, Econometric Society, vol. 85, pages 107-143, January.
    3. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    4. Dworczak, Piotr & Kolotilin, Anton, 2024. "The persuasion duality," Theoretical Economics, Econometric Society, vol. 19(4), November.
    5. Santiago R. Balseiro & Yonatan Gur, 2019. "Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium," Management Science, INFORMS, vol. 65(9), pages 3952-3968, September.
    6. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    7. Laurent Mathevet & Jacopo Perego & Ina Taneva, 2020. "On Information Design in Games," Journal of Political Economy, University of Chicago Press, vol. 128(4), pages 1370-1404.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dirk Bergemann & Paul Duetting & Renato Paes Leme & Song Zuo, 2021. "Calibrated Click-Through Auctions: An Information Design Approach," Cowles Foundation Discussion Papers 2285, Cowles Foundation for Research in Economics, Yale University.
    2. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    3. Morris, Stephen & Bergemann, Dirk & Heumann, Tibor & Sorokin, Constantine & Winter, Eyal, 2021. "Selling Impressions: Efficiency vs. Competition," CEPR Discussion Papers 16507, C.E.P.R. Discussion Papers.
    4. Yoav Kolumbus & Joe Halpern & 'Eva Tardos, 2024. "Paying to Do Better: Games with Payments between Learning Agents," Papers 2405.20880, arXiv.org, revised Feb 2025.
    5. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    6. Caragiannis, Ioannis & Kaklamanis, Christos & Kanellopoulos, Panagiotis & Kyropoulou, Maria & Lucier, Brendan & Paes Leme, Renato & Tardos, Éva, 2015. "Bounding the inefficiency of outcomes in generalized second price auctions," Journal of Economic Theory, Elsevier, vol. 156(C), pages 343-388.
    7. Erdmann, Anett & Arilla, Ramón & Ponzoa, José M., 2022. "Search engine optimization: The long-term strategy of keyword choice," Journal of Business Research, Elsevier, vol. 144(C), pages 650-662.
    8. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    9. repec:upd:utmpwp:018 is not listed on IDEAS
    10. Pycia, Marek & Woodward, Kyle, 2021. "Auctions of Homogeneous Goods: A Case for Pay-as-Bid," CEPR Discussion Papers 15656, C.E.P.R. Discussion Papers.
    11. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2014. "Buy-It-Now or Take-a-Chance: Price Discrimination Through Randomized Auctions," Management Science, INFORMS, vol. 60(12), pages 2927-2948, December.
    12. Zhu Mingxi & Song Michelle, 2024. "Design Information Disclosure under Bidder Heterogeneity in Online Advertising Auctions: Implications of Bid-Adherence Behavior," Papers 2410.05535, arXiv.org.
    13. Rivera Mora, Ernesto, 2024. "Mechanism design with belief-dependent preferences," Journal of Economic Theory, Elsevier, vol. 216(C).
    14. David Easley & Yoav Kolumbus & Eva Tardos, 2025. "Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners," Papers 2502.08597, arXiv.org, revised Jun 2025.
    15. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    16. Kevin He & Fedor Sandomirskiy & Omer Tamuz, 2021. "Private Private Information," Papers 2112.14356, arXiv.org, revised Apr 2025.
    17. Chen, Yi-Chun & Yang, Xiangqian, 2023. "Information design in optimal auctions," Journal of Economic Theory, Elsevier, vol. 212(C).
    18. Masaki Miyashita & Takashi Ui, 2023. "LQG Information Design," Papers 2312.09479, arXiv.org, revised Aug 2025.
    19. Modibo Camara & Jason Hartline & Aleck Johnsen, 2020. "Mechanisms for a No-Regret Agent: Beyond the Common Prior," Papers 2009.05518, arXiv.org.
    20. Feng, Xin, 2020. "Information disclosure on the contest mechanism," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 148-156.
    21. Ludovico Crippa & Yonatan Gur & Bar Light, 2025. "Equilibria under Dynamic Benchmark Consistency in Non-Stationary Multi-Agent Systems," Papers 2501.11897, arXiv.org, revised May 2025.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2507.17187. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.