Combining guaranteed and spot markets in display advertising: selling guaranteed page views with stochastic demand. (English) Zbl 1431.91207
Summary: While page views are often sold instantly through real-time auctions when users visit websites, they can also be sold in advance via guaranteed contracts. In this paper, we present a dynamic programming model to study how an online publisher should optimally allocate and price page views between guaranteed and spot markets. The problem is challenging because the allocation and pricing of guaranteed contracts affect how advertisers split their purchases between the two markets, and the terminal value of the model is endogenously determined by the updated dual force of supply and demand in auctions. We take the advertisers’ purchasing behaviour into consideration, i.e., risk aversion and stochastic demand arrivals, and present a scalable and efficient algorithm for the optimal solution. The model is also empirically validated with a commercial dataset. The experimental results show that selling page views via both channels can increase the publisher’s expected total revenue, and the optimal pricing and allocation strategies are robust to different market and advertiser types.
Keywords:
dynamic programming; display advertising; programmatic guarantee; real-time bidding; revenue maximisationSoftware:
PRMLTReferences:
| [1] | Abraham, I.; Athey, S.; Babaioff, M.; Grubb, M., Peaches, lemons, and cookies: designing auction markets with dispersed information, Proceedings of the 14th ACM conference on electronic commerce, 8-9 (2013) |
| [2] | Anjos, M.; Cheng, R.; Currie, C., Maximizing revenue in the airline industry under one-way pricing, Journal of the Operational Research Society, 55, 5, 535-541 (2004) · Zbl 1060.90681 |
| [3] | Anjos, M.; Cheng, R.; Currie, C., Optimal pricing policies for perishable products, European Journal of Operational Research, 166, 1, 246-254 (2005) · Zbl 1066.90049 |
| [4] | Aviv, Y.; Pazgal, A., Optimal pricing of seasonal products in the presence of forward-looking consumers, Manufacturing & Service Operations Management, 10, 3, 337-562 (2008) |
| [5] | Babaioff, M., Hartline, J., & Kleinberg, R. (2009). Selling ad campaigns: Online algorithms with cancellations. In Proceedings of the 10th ACM conference on electronic commerce, (pp. 61-70).; Babaioff, M., Hartline, J., & Kleinberg, R. (2009). Selling ad campaigns: Online algorithms with cancellations. In Proceedings of the 10th ACM conference on electronic commerce, (pp. 61-70). |
| [6] | Balseiro, S.; Feldman, J.; Mirrokni, V.; Muthukrishnan, M., Yield optimization of display advertising with ad exchange, Management Science, 60, 12, 2886-2907 (2014) |
| [7] | Ben-Zwi, O., Henzinger, M., & Loitzenbauer, V. (2015). Ad exchange: Envy-free auctions with mediators. In Proceedings of the 11th conference web and internet economics, (pp. 104-117).; Ben-Zwi, O., Henzinger, M., & Loitzenbauer, V. (2015). Ad exchange: Envy-free auctions with mediators. In Proceedings of the 11th conference web and internet economics, (pp. 104-117). · Zbl 1406.91157 |
| [8] | Bharadwaj, V., Chen, P., Ma, W., Nagarajan, C., Tomlin, J., Vassilvitskii, S., et al., (2012). Shale: an efficient algorithm for allocation of guaranteed display advertising. In Proceedings of the 18th ACM SIGKDD conference on knowledge discovery and data mining, (pp. 2278-2284).; Bharadwaj, V., Chen, P., Ma, W., Nagarajan, C., Tomlin, J., Vassilvitskii, S., et al., (2012). Shale: an efficient algorithm for allocation of guaranteed display advertising. In Proceedings of the 18th ACM SIGKDD conference on knowledge discovery and data mining, (pp. 2278-2284). |
| [9] | Bharadwaj, V., Ma, W., Schwarz, M., Shanmugasundaram, J., Vee, E., Xie, J., et al., (2010). Pricing guaranteed contracts in online display advertising. Proceedings of the 19th ACM international conference on information and knowledge management, (pp. 399-408).; Bharadwaj, V., Ma, W., Schwarz, M., Shanmugasundaram, J., Vee, E., Xie, J., et al., (2010). Pricing guaranteed contracts in online display advertising. Proceedings of the 19th ACM international conference on information and knowledge management, (pp. 399-408). |
| [10] | Bishop, C., Pattern recognition and machine learning (2006), Springer · Zbl 1107.68072 |
| [11] | Bitran, G.; Caldentey, R., An overview of pricing models for revenue management, Manufacturing & Service Operations Management, 5, 3, 179-267 (2003) |
| [12] | Boyle, P., Option valuation using a three-jump process, International Options Journal, 3, 7-12 (1986) |
| [13] | Caldentey, R.; Vulcano, G., Online auction and list price revenue management, Management Science, 53, 5, 795-813 (2007) · Zbl 1232.91279 |
| [14] | Chen, B. (2016). Risk-aware dynamic reserve prices of programmatic guarantee in display advertising. In Proceedings of the 16th IEEE international conference on data mining workshops, (pp. 511-518).; Chen, B. (2016). Risk-aware dynamic reserve prices of programmatic guarantee in display advertising. In Proceedings of the 16th IEEE international conference on data mining workshops, (pp. 511-518). |
| [15] | Chen, B.; Kankanhalli, M., Pricing average price advertising options when underlying spot market prices are discontinuous, IEEE Transactions on Knowledge and Data Engineering, 31, 9, 1765-1778 (2019) |
| [16] | Chen, B.; Wang, J., A lattice framework for pricing display advertisement options with the stochastic volatility underlying model, Electronic Commerce Research and Applications, 14, 465-479 (2015) |
| [17] | Chen, B.; Wang, J.; Cox, I.; Kankanhalli, M., Multi-keyword multi-click advertisement option contracts for sponsored search, ACM Transactions on Intelligent Systems and Technology, 7, 5 (2015), , https://boweichen.github.io/publications/TIST2015.pdf |
| [18] | Chen, B.; Yuan, S.; Wang, J., A dynamic pricing model for unifying programmatic guarantee and real-time bidding in display advertising, Proceedings of the 8th international workshop on data mining for online advertising, 1-9 (2014) |
| [19] | Chen, Y., Optimal dynamic auctions for display advertising, Operations Research, 65, 4, 897-913 (2017) · Zbl 1372.90112 |
| [20] | Cleveland, W., Robust locally weighted regression and smoothing scatterplots, Journal of the American Statistical Association, 74, 368, 829-836 (1979) · Zbl 0423.62029 |
| [21] | Constantin, F.; Feldman, J.; Muthukrishnan, M.; Pál, M., An online mechanism for ad slot reservations with cancellations, Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, 1265-1274 (2009) · Zbl 1426.91133 |
| [22] | Constantinides, G.; Malliaris, A., Options markets, Equity options markets: Foundations and pricing, I (2001), Edward Elgar Publishing |
| [23] | Cox, J.; Ross, S.; Rubinstein, M., Option pricing: a simplified approach, Journal of Financial Economics, 7, 229-263 (1979) · Zbl 1131.91333 |
| [24] | DoubleClick (2005). The decade in online advertising 1994-2004. White Paper, https://www.slideshare.net/louishatzis/double-click-042005thedecadeinonlineadvertising; DoubleClick (2005). The decade in online advertising 1994-2004. White Paper, https://www.slideshare.net/louishatzis/double-click-042005thedecadeinonlineadvertising |
| [25] | Edelman, B.; Ostrovsky, M.; Schwarz, M., Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords, American Economic Review, 97, 1, 242-259 (2007) |
| [26] | eMarketer (2013). Real-time bidding poised to make up quarter of all display spending. http://goo.gl/04Ykx; eMarketer (2013). Real-time bidding poised to make up quarter of all display spending. http://goo.gl/04Ykx |
| [27] | Feldman, J.; Korula, N.; Mirrokni, V.; Muthukrishnan, M.; Pál, M., Online ad assignment with free disposal, Proceedings of the 5th international workshop on internet and network economics, 374-385 (2009) |
| [28] | Feldman, J.; Mirrokni, V.; Muthukrishnan, S.; Pái, M., Auctions with intermediaries, Proceedings of the 11th ACM conference on electronic commerce, 23-32 (2010) |
| [29] | Fridgeirsdottir, K.; Najafi-Asadolahi, S., Cost-per-impression pricing for display advertising, Operations Research, 66, 3, 597-892 (2018) · Zbl 1443.90231 |
| [30] | Gallego, G.; van Ryzin, G., Optimal dynamic pricing of inventories with stochastic demand over finite horizons, Management Science, 40, 8, 999-1020 (1994) · Zbl 0816.90054 |
| [31] | Gao, L.; Shou, B.; Chen, Y.-J.; Huang, J., Combining spot and futures markets: a hybrid market approach to dynamic spectrum access, Operations Research, 64, 4, 794-821 (2016) · Zbl 1348.91121 |
| [32] | Ghosh, A.; McAfee, P.; Papineni, K.; Vassilvitskii, S., Bidding for representative allocations for display advertising, Proceedings of the 5th international workshop on internet and network economics, 14-18 (2009) |
| [33] | Hojjat, A.; Turner, J.; Cetintas, S.; Yang, J., Delivering guaranteed display ads under reach and frequency requirements, Proceedings of the 28th AAAI conference on artificial intelligence, 2278-2284 (2014) |
| [34] | Ilfeld, J.; Winer, R., Generating website traffic, Journal of Advertising Research, 42, 5, 49-61 (2002) |
| [35] | Kleinberg, J.; Tardos, E., Algorithm design (2005), Addison Wesley |
| [36] | Lahaie, S.; McAfee, P., Efficient ranking in sponsored search, Proceedings of the 7th international conference on internet and network economics, 254-265 (2011) |
| [37] | Lahaie, S.; Pennock, D., Revenue analysis of a family of ranking rules for keyword auctions, Proceedings of the 8th ACM conference on electronic commerce, 50-60 (2007) |
| [38] | Lee, S.; Leckenby, J., Impact of measurement periods on website rankings and traffic estimation: A user-centric approach, Journal of Current Issues and Research in Advertising, 21, 2, 1-10 (1999) |
| [39] | Mansour, Y., Muthukrishnan, S., & Nisan, N. (2012). Doubleclick ad exchange auction. arXiv: https://arxiv.org/abs/1204.0535; Mansour, Y., Muthukrishnan, S., & Nisan, N. (2012). Doubleclick ad exchange auction. arXiv: https://arxiv.org/abs/1204.0535 |
| [40] | McGill, J.; van Ryzin, G., Revenue management: Research overview and prospects, Transportation Science, 33, 2, 233-256 (1999) · Zbl 1002.90032 |
| [41] | Muthukrishnan, M., Ad exchanges: research issues, Proceedings of the 5th international workshop on internet and network economics, 1-12 (2009) |
| [42] | Myerson, R., Optimal auction design, Mathematics of Operational Research, 6, 1, 58-73 (1981) · Zbl 0496.90099 |
| [43] | Najafi-Asadolahi, S.; Fridgeirsdottir, K., Cost-per-click pricing for display advertising, Manufacturing & Service Operations Management, 16, 4, 482-497 (2014) |
| [44] | Narahari, Y., Game theory and mechanism design (2014), World Scientific · Zbl 1336.91001 |
| [45] | OpenX (2013). Programmatic + premium: Current practices and future trends. White Paperhttps://www.slideshare.net/digiday/openx-whitepaper-programmatic-premium-current-practices-and-future-trends; OpenX (2013). Programmatic + premium: Current practices and future trends. White Paperhttps://www.slideshare.net/digiday/openx-whitepaper-programmatic-premium-current-practices-and-future-trends |
| [46] | Ostrovsky, M.; Schwarz, M., Reserve prices in Internet advertising auctions: A field experiment, Proceedings of the 12th ACM conference on electronic commerce, 59-60 (2011) |
| [47] | Parkes, D., Algorithmic game theory.chapter Online Mechanisms. (2007), Cambridge University Press |
| [48] | Radovanovic, A.; Heavlin, W., Risk-aware revenue maximization in display advertising, Proceedings of the 21st international conference on world wide web, 91-100 (2012) |
| [49] | Roels, G.; Fridgeirsdottir, K., Dynamic revenue management for online display advertising, Journal of Revenue & Pricing Management, 8, 5, 452-466 (2009) |
| [50] | Salomatin, K.; Liu, T.; Yang, Y., A unified optimization framework for auction and guaranteed delivery in online advertising, Proceedings of the 21st ACM international conference on information and knowledge management, 2005-2009 (2012) |
| [51] | Sayedi, A., Real-time bidding in online display advertising, Marketing Science, 37, 4, 553-568 (2018) |
| [52] | Su, X., Intertemporal pricing with strategic customer behavior, Management Science, 53, 5, 726-741 (2007) · Zbl 1232.91435 |
| [53] | Sun, Z.; Dawande, M.; Janakiraman, G.; Mookerjee, V., The making of a good impression: information hiding in ad exchanges, MIS Quarterly, 40, 3, 717-739 (2016) |
| [54] | Talluri, K.; van Ryzin, G., The theory and practice of revenue management (2005), Springer |
| [55] | Thompson, D.; Leyton-Brown, K., Revenue optimization in the generalized second-price auction, Proceedings of the 14th ACM conference on electronic commerce, 837-852 (2013) |
| [56] | Varian, H., Position auctions, International Journal of Industrial Organization, 25, 6, 1163-1178 (2007) |
| [57] | Varian, H., Online ad auctions, American Economic Review, 99, 2, 430-434 (2009) |
| [58] | Varian, H.; Harris, C., The VCG auction in theory and practice, American Economic Review, 104, 5, 442-445 (2014) |
| [59] | Wang, J.; Chen, B., Selling futures online advertising slots via option contracts, Proceedings of the 21st international world wide web conference, 627-628 (2012) |
| [60] | Wilmott, P., Paul Wilmott on quantitative finance (2006), John Wiley · Zbl 1127.91002 |
| [61] | Yuan, S.; Wang, J.; Chen, B.; Mason, P.; Seljan, S., An empirical study of reserve price optimisation in real-time bidding, Proceedings of the 20th ACM SIGKDD conference on knowledge discovery and data mining, 1897-1906 (2014) |
| [62] | Yuan, Y.; Wang, F.; Li, J.; Qin, R., A survey on real time bidding advertising, Proceedings of the IEEE international conference on service operations and logistics, and informatics, 418-423 (2014) |
| [63] | Zhang, J.; Wang, Z.; Li, Q.; Zhang, J.; Lan, Y.; Li, Q., Efficient delivery policy to minimize user traffic consumption in guaranteed advertising, Proceedings of the 31st AAAI conference on artificial intelligence, 253-258 (2017) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
