The Planning of Guaranteed Targeted Display Advertising

References

• Abrams Z., Keerthi S. S., Mendelevitch O., Tomlin J. A. Ad delivery with budgeted advertisers: A comprehensive LP approach. J. Electronic Commerce Res. (2008) 9(1):16–32Google Scholar
• Adler M., Gibbons P. B., Matias Y. Scheduling space-sharing for Internet advertising. J. Scheduling (2002) 5(2):103–119Crossref, Google Scholar
• Agarwal D., Broder A. Z., Chakrabarti D., Diklic D., Josifovski V., Sayyadian M. Estimating rates of rare events at multiple resolutions. Proc. 13th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining (2007) (ACM, New York) 16–25Crossref, Google Scholar
• Araman V. F., Fridgeirsdottir K. Cost-per-impression pricing and campaign delivery for online display advertising. (2011) . Working paper, London Business School, LondonGoogle Scholar
• Arango T. Cable firms join forces to attract focused ads. New York Times (2008) March 10Google Scholar
• Birge J. R. Aggregation bounds in stochastic linear programming. Math. Programming (1985) 31(1):25–41Crossref, Google Scholar
• Chlebus E., Brazier J. Nonstationary Poisson modeling of Web browsing session arrivals. Inform. Processing Lett. (2007) 102(5):187–190Crossref, Google Scholar
• Danaher P., Wierenga B. Advertising models. Handbook of Marketing Decision Models (2010) (Springer Science+Business Media, LLC, New York) Google Scholar
• Dawande M., Kumar S., Sriskandarajah C. Performance bounds of algorithms for scheduling advertisements on a Web page. J. Scheduling (2003) 6(4):373–394Crossref, Google Scholar
• De Reyck B., Degraeve Z. Broadcast scheduling for mobile advertising. Oper. Res. (2003) 51(4):509–517Link, Google Scholar
• Edelman B., Ostrovsky M., Schwarz M. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. (2007) 97(1):242–259Crossref, Google Scholar
• Fridgeirsdottir K., Najafi-Asadolahi S. Revenue management for online advertising using advertising networks. (2010) . Working paper, London Business School, LondonGoogle Scholar
• Ghosh A., McAfee P., Papineni K., Vassilvitskii S. Bidding for representative allocations for display advertising. Internet Network Econom. (2009) 208–219 http://dx.doi.org/10.1007/978-3-642-10841-9_20Crossref, Google Scholar
• Hallerman D. U.S. advertising spending: The new reality. eMarketer (2009) May). Accessed May 2011, http://www.emarketer.com/Reporters/All/Emarketer_2000576.aspx/Google Scholar
• Interactive Advertising Bureau 2008 IAB Internet advertising revenue report. (2009) . Accessed April 2011, http://www.iab.net/media/file/IAB_PwC_2008_full_year.pdfGoogle Scholar
• Kumar S., Jacob V. S., Sriskandarajah C. Scheduling advertisements on a Web page to maximize revenue. Eur. J. Oper. Res. (2006) 173(3):1067–1089Crossref, Google Scholar
• Langheinrich M., Nakamura A., Abe N., Kamba T., Koseki Y. Unintrusive customization techniques for Web advertising. Comput. Networks: Internat. J. Comput. Telecomm. Networking (1999) 31(11):1259–1272Crossref, Google Scholar
• Leisten R. A posteriori error bounds in linear programming aggregation. Comput. Oper. Res. (1997) 24(1):1–16Crossref, Google Scholar
• Litvinchev I., Tsurkov V.Aggregation in Large-Scale Optimization (2003) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Litvinchev I. S., Rangel S. Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. (2006) 146(1):119–134Crossref, Google Scholar
• Liu Z., Niclausse N., Jalpa-Villanueva C. Traffic model and performance evaluation of Web servers. Performance Eval. (2001) 46(2–3):77–100Crossref, Google Scholar
• Mandel C. Eye-catching glance at the future. Globe and Mail (2007) June 28). Accessed December 2011, http://www.theglobeandmail.com/archives/eye-catching-glance-at-the-fuure/article767718/Google Scholar
• Mehta A., Saberi A., Vazirani U., Vazirani V. Adwords and generalized online matching. J. ACM (2007) 54(5). Article 22Crossref, Google Scholar
• Menon S., Amiri A. Scheduling banner advertisements on the Web. INFORMS J. Comput. (2004) 16(1):95–105Link, Google Scholar
• Nakamura A., Abe N. Improvements to the linear programming based scheduling of Web advertisements: World Wide Web electronic commerce, security and privacy. Electron. Commerce Res. (2005) 5(1):75–98Crossref, Google Scholar
• Roels G., Fridgeirsdottir K. Dynamic revenue management for online display advertising. J. Revenue Pricing Management (2009) 8(5):452–466Crossref, Google Scholar
• Rogers D. F., Plante R. D., Wong R. T., Evans J. R. Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. (1991) 39(4):553–582Link, Google Scholar
• Surmanek J.Media Planning: A Practical Guide (1996) (NTC Business Books, Chicago) Google Scholar
• Tomlin J., Agarwal D., Yang J. A log-linear model for allocating overlapping inventory to on-line advertisers. INFORMS Annual Conf. (2008) (INFORMS, Hanover, MD) Google Scholar
• Tomlin J., Bharadwaj V., Saunders M. Solution of a stochastic model for allocation of on-line advertising inventory. INFORMS Annual Conf. (2009) (INFORMS, Hanover, MD) Google Scholar
• Tomlin J. A. An entropy approach to unintrusive targeted advertising on the Web. Comput. Networks (2000) 33(1–6):767–774Crossref, Google Scholar
• Turner J. Ad slotting and pricing: New media planning models for new media. (2010) . Ph.D. thesis, Tepper School of Business, Carnegie Mellon University, PittsburghGoogle Scholar
• Turner J., Scheller-Wolf A., Tayur S. Scheduling of dynamic in-game advertising. Oper. Res. (2011) 59(1):1–16Link, Google Scholar
• Vakhutinsky I. Y., Dudkin L. M., Ryvkin A. A. Iterative aggregation: A new approach to the solution of large-scale problems. Econometrica (1979) 47(4):821–841Crossref, Google Scholar
• Walsh W. E., Boutilier C., Sandholm T., Shields R., Nemhauser G., Parkes D. C. Automated channel abstraction for advertising auctions. Proc. 24th AAAI Conf. Artificial Intelligence (2010) AtlantaGoogle Scholar
• Wright S. E. Primal-dual aggregation and disaggregation for stochastic linear programs. Math. Oper. Res. (1994) 19(4):893–908Link, Google Scholar
• Yang J., Tomlin J. Advertising inventory allocation based on multi-objective optimization. INFORMS Annual Conf. (2008) (INFORMS, Hanover, MD) Google Scholar
• Yang J., Vee E., Vassilvitskii S., Tomlin J., Shanmugasundaram J., Anastasakos T., Kennedy O. Inventory allocation for online graphical display advertising. (2010) . Arxiv preprint arXiv:1008.3551Google Scholar
• Zipkin P. H. Bounds for aggregating nodes in network problems. Math. Programming (1980a) 19(1):155–177Crossref, Google Scholar
• Zipkin P. H. Bounds for row-aggregation in linear programming. Oper. Res. (1980b) 28(4):903–916Link, Google Scholar
• Zipkin P. H. Bounds on the effect of aggregating variables in linear programs. Oper. Res. (1980c) 28(2):403–418Link, Google Scholar
• Zipkin P. H. Aggregation and disaggregation in convex network problems. Networks (1982) 12(2):101–117Crossref, Google Scholar
• Zipkin P. H., Raimer K. An improved disaggregation method for transportation problems. Math. Programming (1983) 26(2):238–242Crossref, Google Scholar