Integrated Ad Delivery Planning for Targeted Display Advertising

References

• Abhishek V , Hosanagar K (2013) Optimal bidding in multi-item multislot sponsored search auctions. Oper. Res. 61(4):855–873.Link, Google Scholar
• Araman VF , Popescu I (2010) Media revenue management with audience uncertainty: Balancing upfront and spot market sales. Manufacturing Service Oper. Management 12(2):190–212.Link, Google Scholar
• Ardestani-Jaafari A , Delage E (2016) Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2):474–494.Link, Google Scholar
• Balseiro SR , Feldman J , Mirrokni V , Muthukrishnan S (2014) Yield optimization of display advertising with ad exchange. Management Sci. 60(12):2886–2907.Link, Google Scholar
• Ben-Tal A , Den Hertog D , Vial JP (2015) Deriving robust counterparts of nonlinear uncertain inequalities. Math. Programming 149(1–2):265–299.Crossref, Google Scholar
• Benisch M , Sadeh NM , Sandholm T (2009) Methodology for designing reasonably expressive mechanisms with application to ad auctions. Kitano H, ed. Proc. 21th Internat. Joint Conf. Artificial Intelligence (Morgan Kaufmann Publishers, Inc, San Francisco), 46–52.Google Scholar
• Bertsimas D , Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bhalgat A , Feldman J , Mirrokni V (2012) Online allocation of display ads with smooth delivery. Yang Q, ed. Proc. 18th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1213–1221.Google 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, ed. Proc. 18th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1195–1203.Google Scholar
• Charnes A , Cooper WW (1959) Chance-constrained programming. Management Sci. 6(1):73–79.Link, Google Scholar
• Chen J , Liu D , Whinston AB (2009) Auctioning keywords in online search. J. Marketing 73(4):125–141.Crossref, Google Scholar
• Chen W , Sim M , Sun J , Teo CP (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470–485.Link, Google Scholar
• Chen X , Sim M , Sun P (2007) A robust optimization perspective on stochastic programming. Oper. Res. 55(6):1058–1071.Link, Google Scholar
• Chen YJ (2017) Optimal dynamic auctions for display advertising. Oper. Res. 65(4):897–913.Link, Google Scholar
• Deza A , Huang K , Metel MR (2015) Chance constrained optimization for targeted Internet advertising. Omega 53:90–96.Crossref, Google Scholar
• Edelman B , Ostrovsky M , Schwarz M (2007) Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. 97(1):242–259.Crossref, Google Scholar
• eMarketer (2019) Display ad spending, worldwide. Retrieved August 2019, https://forecasts-na1.emarketer.com/5a4e7234d8690c0c28d1f2e4/5a4e66edd8690c0c28d1f2ab.Google Scholar
• Feng J , Shen ZJM , Zhan L (2007) Ranked items auctions and online advertisement. Production Oper. Management 16(4):510–522.Crossref, Google Scholar
• Ghosh A , McAfee P , Papineni K , Vassilvitskii S (2009) Bidding for representative allocations for display advertising. Leonardi S, ed. Proc. 5th Internat. Workshop Internet Network Econom (WINE’09) (Springer, Berlin), 208–219.Google Scholar
• Hojjat A , Turner J , Cetintas S , Yang J (2017) A unified framework for the scheduling of guaranteed targeted display advertising under reach and frequency requirements. Oper. Res. 65(2):289–313.Link, Google Scholar
• Kontogiorgis S (2000) Practical piecewise-linear approximation for monotropic optimization. INFORMS J. Comput. 12(4):324–340.Link, Google Scholar
• Lejeune M , Turner J (2019) Planning online advertising using Gini indices. Oper. Res. 67(5):1222–1245.Link, Google Scholar
• Li Z , Tang Q , Floudas CA (2012) A comparative theoretical and computational study on robust counterpart optimization: II. Probabilistic guarantees on constraint satisfaction. Indust. Engrg. Chemical Res. 51(19):6769–6788.Crossref, Google Scholar
• Lu S , Zhu Y , Dukes A (2015) Position auctions with budget-constraints: Implications for advertisers and publishers. Marketing Sci. 34(6):897–905.Link, Google Scholar
• Market Research Future (2019) Data management platform (DMP) market research report—forecast up to 2023. Retrieved August 2019, https://www.marketresearchfuture.com/reports/data-management-platform-market-4573.Google Scholar
• McAfee RP , Papineni K , Vassilvitskii S (2013) Maximally representative allocations for guaranteed delivery advertising campaigns. Rev. Econom. Design 17(2):83–94.Crossref, Google Scholar
• Miller BL , Wagner HM (1965) Chance constrained programming with joint constraints. Oper. Res. 13(6):930–945.Link, Google Scholar
• Najafi-Asadolahi S , Fridgeirsdottir K (2014) Cost-per-click pricing for display advertising. Manufacturing Service Oper. Management 16(4):482–497.Link, Google Scholar
• Nemirovski A , Shapiro A (2006) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.Crossref, Google Scholar
• Parkes DC , Sandholm T (2005) Optimize-and-dispatch architecture for expressive ad auctions. First Workshop on Sponsored Search Auctions, at the ACM Conf. Electronic Commerce June 2005 (Vancouver, BC).Google Scholar
• Postek K , Ben-Tal A , den Hertog D , Melenberg B (2018) Robust optimization with ambiguous stochastic constraints under mean and dispersion information. Oper. Res. 66(3):814–833.Link, Google Scholar
• Shamsi D , Holtan M , Luenberger R , Ye Y (2014) Online allocation rules in display advertising. Preprint, submitted July 22, https://arxiv.org/abs/1407.5710.Google Scholar
• Turner J (2012) The planning of guaranteed targeted display advertising. Oper. Res. 60(1):18–33.Link, Google Scholar
• Vee E , Vassilvitskii S , Shanmugasundaram J (2010) Optimal online assignment with forecasts. Parkes DC, ed. Proc. 11th ACM Conf. Electronic Commerce (EC’10) (ACM, New York), 109–118.Google Scholar
• Walsh WE , Boutilier C , Sandholm T , Shields R , Nemhauser GL , Parkes DC (2010) Automated channel abstraction for advertising auctions. Fox M, Poole D, eds. Proc. 24th AAAI Conf. Artificial Intelligence (Association for the Advancement of Artificial Intelligence, Atlanta), 887–894.Google Scholar
• Yang J , Vee E , Vassilvitskii S , Tomlin J , Shanmugasundaram J , Anastasakos T , Kennedy O (2010) Inventory allocation for online graphical display advertising. Technical report YL-2010-04, Yahoo! Labs, Sunnyvale, CA.Google Scholar
• Zhang X , Feng J (2011) Cyclical bid adjustments in search-engine advertising. Management Sci. 57(9):1703–1719.Link, Google Scholar
• Zhu Y , Wilbur KC (2011) Hybrid advertising auctions. Marketing Sci. 30(2):249–273.Link, Google Scholar
• Zipkin PH (1980) Bounds for aggregating nodes in network problems. Math. Programming 19(1):155–177.Crossref, Google Scholar
• Zymler S , Kuhn D , Rustem B (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Crossref, Google Scholar