IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v30y2021i6p1583-1602.html
   My bibliography  Save this article

A Planning Approach to Revenue Management for Non‐Guaranteed Targeted Display Advertising

Author

Listed:
  • Huaxiao Shen
  • Yanzhi Li
  • Jingjing Guan
  • Geoffrey K.F. Tso

Abstract

Many publishers of online display advertising sell their ad resources through event‐based auctions in the spot market. Such a way of selling lacks a holistic view of the publisher’s ad resource and thus suffers from a well‐recognized drawback: the publisher’s revenue is often not maximized, particularly due to users’ dynamic ad clicking behavior and advertisers’ budget constraints. In this study, we propose a planning approach for ad publishers to better allocate their ad resources. Specifically, we propose a framework comprising two building blocks: (i) a mixed‐integer nonlinear programming model that solves for the optimal ad resource allocation plan, which maximizes the publisher’s revenue, for which we have developed an efficient solution algorithm; and (ii) an arbitrary‐point‐inflated Poisson regression model that deals with users’ ad clicking behavior, whereby we directly forecast the number of clicks, instead of relying on the click‐through rate (CTR) as in the literature. The two blocks are closely related in the sense that the output of the regression model serves as the input to the optimization model and the optimization model motivates the development of the regression model. We conduct extensive numerical experiments based on a data set spanning 20 days provided by a leading social network sites firm. Experimental results substantiate the effectiveness of our approach.

Suggested Citation

  • 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.
  • Handle: RePEc:bla:popmgt:v:30:y:2021:i:6:p:1583-1602
    DOI: 10.1111/poms.13275
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13275
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.13275?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. 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.
    2. Xiaoquan (Michael) Zhang & Juan Feng, 2011. "Cyclical Bid Adjustments in Search-Engine Advertising," Management Science, INFORMS, vol. 57(9), pages 1703-1719, February.
    3. 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.
    4. Muralidharan S. Kodialam & Hanan Luss, 1998. "Algorithms for Separable Nonlinear Resource Allocation Problems," Operations Research, INFORMS, vol. 46(2), pages 272-284, April.
    5. 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.
    6. Demetrios Vakratsas & Fred M. Feinberg & Frank M. Bass & Gurumurthy Kalyanaram, 2004. "The Shape of Advertising Response Functions Revisited: A Model of Dynamic Probabilistic Thresholds," Marketing Science, INFORMS, vol. 23(1), pages 109-119, April.
    7. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    8. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    9. Hal R. Varian, 2009. "Online Ad Auctions," American Economic Review, American Economic Association, vol. 99(2), pages 430-434, May.
    10. Jean-Pierre Dubé & Günter Hitsch & Puneet Manchanda, 2005. "An Empirical Model of Advertising Dynamics," Quantitative Marketing and Economics (QME), Springer, vol. 3(2), pages 107-144, June.
    11. Dengpan Liu & Vijay Mookerjee, 2018. "Advertising Competition on the Internet: Operational and Strategic Considerations," Production and Operations Management, Production and Operations Management Society, vol. 27(5), pages 884-901, May.
    12. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    13. 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.
    14. 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. 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. 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.
    3. 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.
    4. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    5. Veronica Marotta & Yue Wu & Kaifu Zhang & Alessandro Acquisti, 2022. "The Welfare Impact of Targeted Advertising Technologies," Information Systems Research, INFORMS, vol. 33(1), pages 131-151, March.
    6. Vahideh Sadat Abedi, 2017. "Allocation of advertising budget between multiple channels to support sales in multiple markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 134-146, February.
    7. Zikun Ye & Dennis J. Zhang & Heng Zhang & Renyu Zhang & Xin Chen & Zhiwei Xu, 2023. "Cold Start to Improve Market Thickness on Online Advertising Platforms: Data-Driven Algorithms and Field Experiments," Management Science, INFORMS, vol. 69(7), pages 3838-3860, July.
    8. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    9. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    10. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    11. Navdeep Sahni, 2015. "Effect of temporal spacing between advertising exposures: Evidence from online field experiments," Quantitative Marketing and Economics (QME), Springer, vol. 13(3), pages 203-247, September.
    12. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    13. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    14. Ali Goli & Simha Mummalaneni & Pradeep K. Chintagunta & Sanjay K. Dhar, 2022. "Show and Sell: Studying the Effects of Branded Cigarette Product Placement in TV Shows on Cigarette Sales," Marketing Science, INFORMS, vol. 41(6), pages 1163-1180, November.
    15. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    16. 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.
    17. Adachi, Kenji & Liu, Donald J., 2006. "Estimating Threshold Effects of Generic Fluid Milk and Cheese Advertising," Staff Papers 13754, University of Minnesota, Department of Applied Economics.
    18. 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.
    19. Nobuhiko Terui & Masataka Ban, 2008. "Modeling heterogeneous effective advertising stock using single-source data," Quantitative Marketing and Economics (QME), Springer, vol. 6(4), pages 415-438, December.
    20. Shen, Yuelin, 2018. "Pricing contracts and planning stochastic resources in brand display advertising," Omega, Elsevier, vol. 81(C), pages 183-194.

    More about this item

    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:bla:popmgt:v:30:y:2021:i:6:p:1583-1602. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.