IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v31y2020i1p126-147.html
   My bibliography  Save this article

Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges

Author

Listed:
  • Sameer Mehta

    (The University of Texas at Dallas, Richardson, Texas 75080;)

  • Milind Dawande

    (The University of Texas at Dallas, Richardson, Texas 75080;)

  • Ganesh Janakiraman

    (The University of Texas at Dallas, Richardson, Texas 75080;)

  • Vijay Mookerjee

    (The University of Texas at Dallas, Richardson, Texas 75080)

Abstract

In the mobile advertising ecosystem, the role of ad exchanges to match advertisers and publishers has grown significantly over the past few years. At a mobile ad exchange, impressions (i.e., opportunities to display ads) are sold to advertisers in real time through an auction mechanism. The traditional mechanism selects a single advertiser whose ad is displayed over the entire duration of an impression, that is, throughout the user’s visit. We argue that such a mechanism leads to an allocative inefficiency , as displaying only the winning ad throughout the lifetime of an impression precludes the exchange from exploiting the opportunity to obtain additional revenue from advertisers whose willingness to pay becomes higher during the lifetime of that impression. Our goal in this paper is to address this efficiency loss by offering mechanisms in which multiple ads can be displayed sequentially over the lifetime of the impression. We consider two plausible settings—one where each auction is individually rational for the advertisers and one where advertisers are better off relative to the traditional mechanism over the long run—and derive an optimal (i.e., revenue-maximizing for the ad exchange) mechanism for each setting. To efficiently compute the payment rule, the optimal mechanism for the former setting uses randomized payments. Under this mechanism, whereas the ad exchange always benefits relative to the traditional mechanism, the advertisers could either gain or lose—we demonstrate both these possibilities. The optimal mechanism for the latter setting is a “mutually beneficial” mechanism in that it guarantees a win–win for both the parties relative to the traditional mechanism, over the long run. Happily, for both the mechanisms, the allocation of ads and the payments from the advertisers are efficiently computable, thereby making them amenable to real-time bidding.

Suggested Citation

  • Sameer Mehta & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges," Information Systems Research, INFORMS, vol. 31(1), pages 126-147, March.
  • Handle: RePEc:inm:orisre:v:31:y:2020:i:1:p:126-147
    DOI: 10.1287/isre.2019.0878
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/isre.2019.0878
    Download Restriction: no

    File URL: https://libkey.io/10.1287/isre.2019.0878?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. De Liu & Jianqing Chen & Andrew B. Whinston, 2010. "Ex Ante Information and the Design of Keyword Auctions," Information Systems Research, INFORMS, vol. 21(1), pages 133-153, March.
    2. Santiago R. Balseiro & Jon Feldman & Vahab Mirrokni & S. Muthukrishnan, 2014. "Yield Optimization of Display Advertising with Ad Exchange," Management Science, INFORMS, vol. 60(12), pages 2886-2907, December.
    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. Avi Goldfarb & Catherine Tucker, 2011. "Online Display Advertising: Targeting and Obtrusiveness," Marketing Science, INFORMS, vol. 30(3), pages 389-404, 05-06.
    5. John Turner & Alan Scheller-Wolf & Sridhar Tayur, 2011. "OR PRACTICE---Scheduling of Dynamic In-Game Advertising," Operations Research, INFORMS, vol. 59(1), pages 1-16, February.
    6. Avi Goldfarb & Catherine Tucker, 2011. "Rejoinder--Implications of "Online Display Advertising: Targeting and Obtrusiveness"," Marketing Science, INFORMS, vol. 30(3), pages 413-415, 05-06.
    7. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    8. Alex Kim & Subramanian Balachander & Karthik Kannan, 2012. "On the optimal number of advertising slots in a generalized second-price auction," Marketing Letters, Springer, vol. 23(3), pages 851-868, September.
    9. Patrali Chatterjee & Donna L. Hoffman & Thomas P. Novak, 2003. "Modeling the Clickstream: Implications for Web-Based Advertising Efforts," Marketing Science, INFORMS, vol. 22(4), pages 520-541, May.
    10. Ali Hojjat & John Turner & Suleyman Cetintas & Jian Yang, 2017. "A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements," Operations Research, INFORMS, vol. 65(2), pages 289-313, April.
    11. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    12. Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, University Library of Munich, Germany, revised 28 Apr 1998.
    13. Michael Braun & Wendy W. Moe, 2013. "Online Display Advertising: Modeling the Effects of Multiple Creatives and Individual Impression Histories," Marketing Science, INFORMS, vol. 32(5), pages 753-767, September.
    14. Vibhanshu Abhishek & Kartik Hosanagar, 2013. "Optimal Bidding in Multi-Item Multislot Sponsored Search Auctions," Operations Research, INFORMS, vol. 61(4), pages 855-873, August.
    15. Yuxin Chen & Xinxin Li & Monic Sun, 2017. "Competitive Mobile Geo Targeting," Marketing Science, INFORMS, vol. 36(5), pages 666-682, September.
    16. Kursad Asdemir & Nanda Kumar & Varghese S. Jacob, 2012. "Pricing Models for Online Advertising: CPM vs. CPC," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 804-822, September.
    17. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    18. Zhen Sun & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2017. "Not Just a Fad: Optimal Sequencing in Mobile In-App Advertising," Information Systems Research, INFORMS, vol. 28(3), pages 511-528, September.
    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. 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.
    2. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    3. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    4. Shengqi Ye & Goker Aydin & Shanshan Hu, 2015. "Sponsored Search Marketing: Dynamic Pricing and Advertising for an Online Retailer," Management Science, INFORMS, vol. 61(6), pages 1255-1274, June.
    5. Mengzhou Zhuang & Eric (Er) Fang & Jongkuk Lee & Xiaoling Li, 2021. "The Effects of Price Rank on Clicks and Conversions in Product List Advertising on Online Retail Platforms," Information Systems Research, INFORMS, vol. 32(4), pages 1412-1430, December.
    6. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    7. Alex Jiyoung Kim & Subramanian Balachander, 2023. "Coordinating traditional media advertising and online advertising in brand marketing," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1865-1879, June.
    8. Duan, Yongrui & Liu, Peng & Feng, Yixuan, 2022. "Pricing strategies of two-sided platforms considering privacy concerns," Journal of Retailing and Consumer Services, Elsevier, vol. 64(C).
    9. Zhen Sun & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2017. "Not Just a Fad: Optimal Sequencing in Mobile In-App Advertising," Information Systems Research, INFORMS, vol. 28(3), pages 511-528, September.
    10. Jan Krämer & Daniel Schnurr & Michael Wohlfarth, 2019. "Winners, Losers, and Facebook: The Role of Social Logins in the Online Advertising Ecosystem," Management Science, INFORMS, vol. 65(4), pages 1678-1699, April.
    11. Huaxiao Shen & Yanzhi Li & Jingjing Guan & Geoffrey K.F. Tso, 2021. "A Planning Approach to Revenue Management for Non‐Guaranteed Targeted Display Advertising," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1583-1602, June.
    12. Chunhua Wu, 2015. "Matching Value and Market Design in Online Advertising Networks: An Empirical Analysis," Marketing Science, INFORMS, vol. 34(6), pages 906-921, November.
    13. Mahsa Derakhshan & Negin Golrezaei & Renato Paes Leme, 2022. "Linear Program-Based Approximation for Personalized Reserve Prices," Management Science, INFORMS, vol. 68(3), pages 1849-1864, March.
    14. Bayer, Emanuel & Srinivasan, Shuba & Riedl, Edward J. & Skiera, Bernd, 2020. "The impact of online display advertising and paid search advertising relative to offline advertising on firm performance and firm value," International Journal of Research in Marketing, Elsevier, vol. 37(4), pages 789-804.
    15. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    16. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    17. van Ewijk, Bernadette J. & Stubbe, Astrid & Gijsbrechts, Els & Dekimpe, Marnik G., 2021. "Online display advertising for CPG brands: (When) does it work?," International Journal of Research in Marketing, Elsevier, vol. 38(2), pages 271-289.
    18. Goh, Khim-Yong & Chu, Junhong & Wu, Jing, 2015. "Mobile Advertising: An Empirical Study of Temporal and Spatial Differences in Search Behavior and Advertising Response," Journal of Interactive Marketing, Elsevier, vol. 30(C), pages 34-45.
    19. Shen, Yuelin, 2018. "Pricing contracts and planning stochastic resources in brand display advertising," Omega, Elsevier, vol. 81(C), pages 183-194.
    20. Nicolás Figueroa & Vasiliki Skreta, 2011. "Optimal allocation mechanisms with single-dimensional private information," Review of Economic Design, Springer;Society for Economic Design, vol. 15(3), pages 213-243, September.

    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:inm:orisre:v:31:y:2020:i:1:p:126-147. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.