IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v60y2012i1p18-33.html
   My bibliography  Save this article

The Planning of Guaranteed Targeted Display Advertising

Author

Listed:
  • John Turner

    (The Paul Merage School of Business, University of California at Irvine, Irvine, California 92697)

Abstract

As targeted advertising becomes prevalent in a wide variety of media vehicles, planning models become increasingly important to ad networks that need to match ads to appropriate audience segments, provide a high quality of service (meet advertisers' goals), and ensure that ad serving opportunities are not wasted. We define Guaranteed Targeted Display Advertising (GTDA) as a class of media vehicles that include webpage banner ads, video games, electronic outdoor billboards, and the next generation of digital TV, and formulate the GTDA planning problem as a transportation problem with quadratic objective. By modeling audience uncertainty, forecast errors, and the ad server's execution of the plan, we derive sufficient conditions that state when our quadratic objective is a good surrogate for several ad delivery performance metrics. Moreover, our quadratic objective allows us to construct duality-based bounds for evaluating aggregations of the audience space, leading to two efficient algorithms for solving large problems: the first intelligently refines the audience space into successively smaller blocks, and the second uses scaling to find a feasible solution given a fixed audience space partition. Near-optimal schedules can often be produced despite significant aggregation.

Suggested Citation

  • John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    • Handle: RePEc:inm:oropre:v:60:y:2012:i:1:p:18-33
    DOI: 10.1287/opre.1110.0996
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.0996
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.0996?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. 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.
    2. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
    3. 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.
    4. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    5. Kumar, Subodha & Jacob, Varghese S. & Sriskandarajah, Chelliah, 2006. "Scheduling advertisements on a web page to maximize revenue," European Journal of Operational Research, Elsevier, vol. 173(3), pages 1067-1089, September.
    6. S. E. Wright, 1994. "Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 893-908, November.
    7. Bert de Reyck & Zeger Degraeve, 2003. "Broadcast Scheduling for Mobile Advertising," Operations Research, INFORMS, vol. 51(4), pages 509-517, August.
    8. Paul H. Zipkin, 1980. "Bounds for Row-Aggregation in Linear Programming," Operations Research, INFORMS, vol. 28(4), pages 903-916, August.
    9. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    10. Vakhutinsky, I Y & Dudkin, L M & Ryvkin, A A, 1979. "Iterative Aggregation-A New Approach to the Solution of Large-Scale Problems," Econometrica, Econometric Society, vol. 47(4), pages 821-841, July.
    11. Igor Litvinchev & Socorro Rangel, 2006. "Using error bounds to compare aggregated generalized transportation models," Annals of Operations Research, Springer, vol. 146(1), pages 119-134, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shen, Yuelin, 2018. "Pricing contracts and planning stochastic resources in brand display advertising," Omega, Elsevier, vol. 81(C), pages 183-194.
    2. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    3. 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.
    4. 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.
    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. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    7. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    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. Deza, Antoine & Huang, Kai & Metel, Michael R., 2015. "Chance constrained optimization for targeted Internet advertising," Omega, Elsevier, vol. 53(C), pages 90-96.
    10. 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.
    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. 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.
    13. Manmohan Aseri & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2018. "Procurement Policies for Mobile-Promotion Platforms," Management Science, INFORMS, vol. 64(10), pages 4590-4607, October.
    14. Abedi, Vahideh Sadat, 2019. "Compartmental diffusion modeling: Describing customer heterogeneity & communication network to support decisions for new product introductions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    15. Bert De Reyck & Ioannis Fragkos & Yael Grushka-Cockayne & Casey Lichtendahl & Hammond Guerin & Andrew Kritzer, 2017. "Vungle Inc. Improves Monetization Using Big Data Analytics," Interfaces, INFORMS, vol. 47(5), pages 454-466, October.
    16. Maxime C. Cohen & Antoine Désir & Nitish Korula & Balasubramanian Sivan, 2023. "Best of Both Worlds Ad Contracts: Guaranteed Allocation and Price with Programmatic Efficiency," Management Science, INFORMS, vol. 69(7), pages 4027-4050, July.
    17. 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.
    18. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    19. 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.
    20. Zhang, Jianqiang & He, Xiuli, 2019. "Targeted advertising by asymmetric firms," Omega, Elsevier, vol. 89(C), pages 136-150.

    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. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    2. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    3. Merrick, James H. & Weyant, John P., 2019. "On choosing the resolution of normative models," European Journal of Operational Research, Elsevier, vol. 279(2), pages 511-523.
    4. 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.
    5. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    6. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    7. Merrick, James H., 2016. "On representation of temporal variability in electricity capacity planning models," Energy Economics, Elsevier, vol. 59(C), pages 261-274.
    8. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    9. ManMohan S. Sodhi, 2005. "LP Modeling for Asset-Liability Management: A Survey of Choices and Simplifications," Operations Research, INFORMS, vol. 53(2), pages 181-196, April.
    10. Jornsten, Kurt & Leisten, Rainer, 1995. "Decomposition and iterative aggregation in hierarchical and decentralised planning structures," European Journal of Operational Research, Elsevier, vol. 86(1), pages 120-141, October.
    11. Alexander H. Gose & Brian T. Denton, 2016. "Sequential Bounding Methods for Two-Stage Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 351-369, May.
    12. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.
    13. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2023. "Peak-Load Energy Management by Direct Load Control Contracts," Management Science, INFORMS, vol. 69(5), pages 2788-2813, May.
    14. M S Sodhi & C S Tang, 2011. "Determining supply requirement in the sales-and-operations-planning (S&OP) process under demand uncertainty: a stochastic programming formulation and a spreadsheet implementation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(3), pages 526-536, March.
    15. Merrick, James H. & Bistline, John E.T. & Blanford, Geoffrey J., 2024. "On representation of energy storage in electricity planning models," Energy Economics, Elsevier, vol. 136(C).
    16. 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.
    17. Julia Higle & Suvrajeet Sen, 2006. "Multistage stochastic convex programs: Duality and its implications," Annals of Operations Research, Springer, vol. 142(1), pages 129-146, February.
    18. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    19. Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.
    20. Prerna Manik & Anshu Gupta & P. C. Jha & Kannan Govindan, 2016. "A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-41, April.

    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:oropre:v:60:y:2012:i:1:p:18-33. 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.