IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2601.09541.html

Targeting Information in Ad Auction Mechanisms

Author

Listed:
  • Srinivas Tunuguntla
  • Carl F. Mela
  • Jason Pratt

Abstract

Digital advertising platforms and publishers sell ad inventory that conveys targeting information, such as demographic, contextual, or behavioral audience segments, to advertisers. While revealing this information improves ad relevance, it can reduce competition and lower auction revenues. To resolve this trade-off, this paper develops a general auction mechanism -- the Information-Bundling Position Auction (IBPA) mechanism -- that leverages the targeting information to maximize publisher revenue across both search and display advertising environments. The proposed mechanism treats the ad inventory type as the publisher's private information and allocates impressions by comparing advertisers' marginal revenues. We show that IBPA resolves the trade-off between targeting precision and market thickness: publisher revenue is increasing in information granularity and decreasing in disclosure granularity. Moreover, IBPA dominates the generalized second-price (GSP) auction for any distribution of advertiser valuations and under any information or disclosure regime. We also characterize computationally efficient approximations that preserve these guarantees. Using auction-level data from a large retail media platform, we estimate advertiser valuation distributions and simulate counterfactual outcomes. Relative to GSP, IBPA increases publisher revenue by 68%, allocation rate by 19pp, advertiser welfare by 29%, and total welfare by 54%.

Suggested Citation

  • Srinivas Tunuguntla & Carl F. Mela & Jason Pratt, 2026. "Targeting Information in Ad Auction Mechanisms," Papers 2601.09541, arXiv.org.
  • Handle: RePEc:arx:papers:2601.09541
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Sergiu Hart & Noam Nisan, 2013. "The Menu-Size Complexity of Auctions," Discussion Paper Series dp637, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    2. Rochet, J. C., 1985. "The taxation principle and multi-time Hamilton-Jacobi equations," Journal of Mathematical Economics, Elsevier, vol. 14(2), pages 113-128, April.
    3. Jonathan Levin & Paul Milgrom, 2010. "Online Advertising: Heterogeneity and Conflation in Market Design," American Economic Review, American Economic Association, vol. 100(2), pages 603-607, May.
    4. Kim, Kyungmin & Koh, Youngwoo, 2022. "Auctions with flexible information acquisition," Games and Economic Behavior, Elsevier, vol. 133(C), pages 256-281.
    5. Avi Goldfarb & Verina F. Que, 2023. "The Economics of Digital Privacy," Annual Review of Economics, Annual Reviews, vol. 15(1), pages 267-286, September.
    6. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    7. Manelli, Alejandro M. & Vincent, Daniel R., 2012. "Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly. A corrigendum," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2492-2493.
    8. 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.
    9. Song Yao & Carl F. Mela, 2011. "A Dynamic Model of Sponsored Search Advertising," Marketing Science, INFORMS, vol. 30(3), pages 447-468, 05-06.
    10. Dirk Bergemann & Tibor Heumann & Stephen Morris & Constantine Sorokin & Eyal Winter, 2022. "Optimal Information Disclosure in Classic Auctions," American Economic Review: Insights, American Economic Association, vol. 4(3), pages 371-388, September.
    11. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    12. Bulow, Jeremy & Roberts, John, 1989. "The Simple Economics of Optimal Auctions," Journal of Political Economy, University of Chicago Press, vol. 97(5), pages 1060-1090, October.
    13. Amin Sayedi, 2018. "Real-Time Bidding in Online Display Advertising," Marketing Science, INFORMS, vol. 37(4), pages 553-568, August.
    14. Francesco Balocco & Yixin Lu & Ting Li & Alok Gupta, 2025. "Lemon Ads: Adverse Selection in Multichannel Display Advertising Markets," Management Science, INFORMS, vol. 71(12), pages 10244-10260, December.
    15. William James Adams & Janet L. Yellen, 1976. "Commodity Bundling and the Burden of Monopoly," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 90(3), pages 475-498.
    16. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    17. Manelli, Alejandro M. & Vincent, Daniel R., 2006. "Bundling as an optimal selling mechanism for a multiple-good monopolist," Journal of Economic Theory, Elsevier, vol. 127(1), pages 1-35, March.
    18. Chen, Yi-Chun & Yang, Xiangqian, 2023. "Information design in optimal auctions," Journal of Economic Theory, Elsevier, vol. 212(C).
    19. Dokyun Lee & Kartik Hosanagar & Harikesh S. Nair, 2018. "Advertising Content and Consumer Engagement on Social Media: Evidence from Facebook," Management Science, INFORMS, vol. 64(11), pages 5105-5131, November.
    20. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    21. Omid Rafieian & Hema Yoganarasimhan, 2021. "Targeting and Privacy in Mobile Advertising," Marketing Science, INFORMS, vol. 40(2), pages 193-218, March.
    22. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    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. Szalay, Dezső & Ketelaar, Felix, 2014. "Pricing a Package of Services," CEPR Discussion Papers 10313, C.E.P.R. Discussion Papers.
    2. 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.
    3. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    4. W. Jason Choi & Amin Sayedi, 2024. "Agency Market Power and Information Disclosure in Online Advertising," Marketing Science, INFORMS, vol. 43(6), pages 1279-1298, November.
    5. Ketelaar, Felix & Szalay, Dezsö, 2014. "Pricing a Package of Services - When (not) to bundle," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 487, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
    6. W. Jason Choi & Amin Sayedi, 2023. "Open and Private Exchanges in Display Advertising," Marketing Science, INFORMS, vol. 42(3), pages 451-475, May.
    7. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    8. Ming Chen & Sareh Nabi & Marciano Siniscalchi, 2023. "Advancing Ad Auction Realism: Practical Insights & Modeling Implications," Papers 2307.11732, arXiv.org, revised Apr 2024.
    9. Omid Rafieian & Hema Yoganarasimhan, 2021. "Targeting and Privacy in Mobile Advertising," Marketing Science, INFORMS, vol. 40(2), pages 193-218, March.
    10. Quintero Jaramillo, Jose E., 2004. "Liquidity constraints and credit subsidies in auctions," DEE - Working Papers. Business Economics. WB wb040604, Universidad Carlos III de Madrid. Departamento de Economía de la Empresa.
    11. Avi Goldfarb, 2014. "What is Different About Online Advertising?," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 44(2), pages 115-129, March.
    12. Abraham, Ittai & Athey, Susan & Babaioff, Moshe & Grubb, Michael D., 2020. "Peaches, lemons, and cookies: Designing auction markets with dispersed information," Games and Economic Behavior, Elsevier, vol. 124(C), pages 454-477.
    13. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    14. Chen, Bo & Ni, Debing, 2017. "Optimal bundle pricing under correlated valuations," International Journal of Industrial Organization, Elsevier, vol. 52(C), pages 248-281.
    15. Mark Armstrong, 2016. "Nonlinear Pricing," Annual Review of Economics, Annual Reviews, vol. 8(1), pages 583-614, October.
    16. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    17. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    18. Arefeva, Alina & Meng, Delong, 2021. "Revealing information in auctions: The optimal auction versus the second-price auction," Economics Letters, Elsevier, vol. 204(C).
    19. 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.
    20. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.

    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:2601.09541. 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.