A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements

Published Online:https://doi.org/10.1287/opre.2016.1567

References

  • Abrams Z, Keerthi SS, Mendelevitch O, Tomlin JA (2008) Ad delivery with budgeted advertisers: A comprehensive LP approach. J. Electronic Commerce Res. 9(1):16–32.Google Scholar
  • Adaptly (2014) A research study on sequenced for call to action vs. sustained call to action. Accessed September 2016, http://adaptly.com/wp-content/uploads/2014/11/Adaptly-Refinery29-White-Paper-2014.pdf.Google Scholar
  • Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.LinkGoogle Scholar
  • Balseiro SR, Feldman J, Mirrokni V, Muthukrishnan S (2014) Yield optimization of display advertising with ad exchange. Management Sci. 60(12):2886–2907.LinkGoogle Scholar
  • Bharadwaj V, Chen P, Ma W, Nagarajan C, Tomlin J, Vassilvitskii S, Vee E, Yang J (2012) SHALE: An efficient algorithm for allocation of guaranteed display advertising. Yang Q, Agarwal D, Pei J, eds. Proc. 18th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, KDD ’12 (ACM, New York), 1195–1203.CrossrefGoogle Scholar
  • Buchbinder N, Feldman M, Ghosh A, Naor JS (2011) Frequency capping in online advertising. Dehne F, Iacono J, Sack J-R, eds. Algorithms and Data Structures (Springer, Berlin), 147–158.CrossrefGoogle Scholar
  • Campbell MC, Keller KL (2003) Brand familiarity and advertising repetition effects. J. Consumer Res. 30(2):292–304.CrossrefGoogle Scholar
  • Chandler-Pepelnjak J, Song Y-B (2003) Optimal frequency—The impact of frequency on conversion rates. Atlas Digital Insights. Accessed September 2016, http://advertising.microsoft.com/wwdocs/user/en-us/researchlibrary/researchreport/OptFrequency.pdf.Google Scholar
  • Chen P, Ma W, Mandalapu S, Nagarjan C, Shanmugasundaram J, Vassilvitskii S, Vee E, Yu M, Zien J (2012) Ad serving using a compact allocation plan. Faltings B, Leyton-Brown K, Ipeirotis P, eds. Proc. 13th ACM Conf. Electronic Commerce, EC ’12 (ACM, New York), 319–336.CrossrefGoogle Scholar
  • Chickering DM, Heckerman D (2003) Targeted advertising on the web with inventory management. Interfaces 33(5):71–77.LinkGoogle Scholar
  • Desaulniers G, Desrosiers J, Solomon MM (2005) Column Generation (Springer, New York).CrossrefGoogle Scholar
  • Devanur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. Chuang J, Fortnow L, Pu P, eds. Proc. 10th ACM Conf. Electronic Commerce, EC ’09 (ACM, New York), 71–78.CrossrefGoogle Scholar
  • Devanur NR, Jain K, Sivan B, Wilkens CA (2011) Near optimal online algorithms and fast approximation algorithms for resource allocation problems. Shoham Y, Chen Y, Roughgarden T, eds. Proc. 12th ACM Conf. Electronic Commerce, EC ’11 (ACM, New York), 29–38.CrossrefGoogle Scholar
  • eMarketer (2009) The great GRP debate. Accessed September 2016, http://www.emarketer.com/Articles/Print.aspx?R=1007174.Google Scholar
  • eMarketer (2014) How do you combine TV and digital video? Accessed September 2016, http://www.emarketer.com/Articles/Print.aspx?R=1010900.Google Scholar
  • eMarketer (2015) Facebook and Twitter will take 33% share of U.S. digital display market by 2017. Accessed September 2016, http://www.emarketer.com/Articles/Print.aspx?R=1012274.Google Scholar
  • Feichtinger G, Hartl RF, Sethi SP (1994) Dynamic optimal control models in advertising: Recent developments. Management Sci. 40(2):195–226.LinkGoogle Scholar
  • Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. Proc. 50th Annual IEEE Sympos. Foundations Comput. Sci., FOCS ’09 (IEEE Computer Society, Washington, DC), 117–126.CrossrefGoogle Scholar
  • Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. de Berg M, Meyer U, eds. Proc. 18th Annual Eur. Sympos. Algorithms, ESA ’10 (Springer, Berlin), 182–194.CrossrefGoogle Scholar
  • Ghosh A, McAfee P, Papineni K, Vassilvitskii S (2009) Bidding for representative allocations for display advertising. Leonardi S, ed. 5th Internat. Workshop on Internet and Network Econom., WINE ’09 (Springer, Berlin), 208–219.CrossrefGoogle Scholar
  • Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.LinkGoogle Scholar
  • Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to adwords. Mathieu C, ed. Proc. Nineteenth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’08 (SIAM, Philadelphia), 982–991.Google Scholar
  • Hojjat A, Turner J, Cetintas S, Yang J (2014) Delivering guaranteed display ads under reach and frequency requirements. Brodley CE, Stone P, eds. Proc. 28th AAAI Conf. Artificial Intelligence (AAAI, Palo Alto, CA), 2278–2284.Google Scholar
  • Interactive Advertising Bureau (2015) IAB 2014 full-year Internet advertising revenue report. Accessed September 2016, http://www.iab.net/research/industry_data_and_landscape/adrevenuereport.Google Scholar
  • Jones D, Tamiz M (2010) Practical Goal Programming, (Springer, New York).CrossrefGoogle Scholar
  • Kattula J, Lewis J, Dailey J (2015) Behind the buzz: People-based marketing defined. Atlas Solutions, LLC. Accessed September 2016, https://atlassolutionstwo.files.wordpress.com/2015/05/atlas_white_paper_people-based_marketing_may_2015.pdf.Google Scholar
  • Langheinrich M, Nakamura A, Abe N, Kamba T, Koseki Y (1999) Unintrusive customization techniques for web advertising. Comput. Networks 31(11):1259–1272.CrossrefGoogle Scholar
  • Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.LinkGoogle Scholar
  • Manshadi VH, Gharan SO, Saberi A (2012) Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37(4):559–573.LinkGoogle Scholar
  • Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, New York).Google Scholar
  • Mehta A (2012) Online matching and ad allocation. Theoretical Comput. Sci. 8(4):265–368.Google Scholar
  • Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM 54(5):Article 22.CrossrefGoogle Scholar
  • Mookerjee R, Kumar S, Mookerjee VS (2012) To show or not show: Using user profiling to manage Internet advertisement campaigns at Chitika. Interfaces 42(5):449–464.LinkGoogle Scholar
  • Najafi-Asadolahi S, Fridgeirsdottir K (2014) Cost-per-click pricing for display advertising. Manufacturing Service Oper. Management 16(4):482–497.LinkGoogle Scholar
  • Nakamura A, Abe N (2005) Improvements to the linear programming based scheduling of web advertisements. Electronic Commerce Res. 5(1):75–98.CrossrefGoogle Scholar
  • Roels G, Fridgeirsdottir K (2009) Dynamic revenue management for online display advertising. J. Revenue Pricing Management 8(5):452–466.CrossrefGoogle Scholar
  • Salomatin K, Liu T-Y, Yang Y (2012) A unified optimization framework for auction and guaranteed delivery in online advertising. Chen X-W, Lebanon G, Wang H, Zaki MJ, eds. Proc. 21st ACM Internat. Conf. Information and Knowledge Management, CIKM ’12 (ACM, New York), 2005–2009.CrossrefGoogle Scholar
  • Sethi SP (1977) Dynamic optimal control models in advertising: A survey. SIAM Rev. 19(4):685–725.CrossrefGoogle Scholar
  • Sniedovich M (2010) Dynamic Programming: Foundations and Principles (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Tomlin JA (2000) An entropy approach to unintrusive targeted advertising on the web. Comput. Networks 33(1):767–774.CrossrefGoogle Scholar
  • Turner J (2012) The planning of guaranteed targeted display advertising. Oper. Res. 60(1):18–33.LinkGoogle Scholar
  • Vee E, Vassilvitskii S, Shanmugasundaram J (2010) Optimal online assignment with forecasts. Parkes DC, Dellarocas C, Tennenholtz M, eds. Proc. 11th ACM Conf. Electronic Commerce, EC ’10 (ACM, New York), 109–118.CrossrefGoogle Scholar
  • Warc (2015) Marketers rely on “broken” cookies. http://www.warc.com/LatestNews/News/EmailNews.news?ID=35181.Google Scholar
  • Yang J, Vee E, Vassilvitskii S, Tomlin J, Shanmugasundaram J, Anastasakos T, Kennedy O (2010) Inventory allocation for online graphical display advertising. Preprint arXiv:1008.3551.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.