skip to main content
research-article

Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms

Published:15 December 2021Publication History
Skip Abstract Section

Abstract

We study the optimal bids and allocations in a real-time auction for heterogeneous items subject to the requirement that specified collections of items of given types be acquired within given time constraints. The problem is cast as a continuous time optimization problem that can, under certain weak assumptions, be reduced to a convex optimization problem. Focusing on the standard first and second price auctions, we first show, using convex duality, that the optimal (infinite dimensional) bidding policy can be represented by a single finite vector of so-called ''pseudo-bids''. Using this result we are able to show that the optimal solution in the second price case turns out to be a very simple piecewise constant function of time. This contrasts with the first price case that is more complicated. Despite the fact that the optimal solution for the first price auction is genuinely dynamic, we show that there remains a close connection between the two cases and that, empirically, there is almost no difference between optimal behavior in either setting. This suggests that it is adequate to bid in a first price auction as if it were in fact second price. Finally, we detail methods for implementing our bidding policies in practice with further numerical simulations illustrating the performance.

References

  1. Akshay Agrawal, Robin Verschueren, Steven Diamond, and Stephen Boyd. 2018. A rewriting system for convex optimization problems. Journal of Control and Decision , Vol. 5, 1 (2018), 42--60.Google ScholarGoogle ScholarCross RefCross Ref
  2. Santiago R Balseiro, Omar Besbes, and Gabriel Y Weintraub. 2015. Repeated auctions with budgets in ad exchanges: Approximations and design. Management Science , Vol. 61, 4 (2015), 864--884.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Santiago R Balseiro and Yonatan Gur. 2019. Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Science , Vol. 65, 9 (2019), 3952--3968.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dimitri P Bertsekas. 2008. Extended monotropic programming and duality. Journal of optimization theory and applications , Vol. 139, 2 (2008), 209--225.Google ScholarGoogle ScholarCross RefCross Ref
  5. Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization .Cambridge University Press. https://web.stanford.edu/ boyd/cvxbook/Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Pornpawee Bumpensanti and He Wang. 2020. A re-solving heuristic with uniformly bounded loss for network revenue management. Management Science , Vol. 66, 7 (2020), 2993--3009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Han Cai, Kan Ren, and Weinan Zhang et. al. 2017. Real-Time Bidding by Reinforcement Learning in Display Advertising. CoRR , Vol. abs/1701.02490 (2017). http://dblp.uni-trier.de/db/journals/corr/corr1701.html#CaiRZMWYG17Google ScholarGoogle Scholar
  8. Ye Chen, Pavel Berkhin, Bo Anderson, and Nikhil R. Devanur. 2011. Real-time bidding algorithms for performance-based display ad allocation.. In KDD , , Chid Apté, Joydeep Ghosh, and Padhraic Smyth (Eds.). ACM, 1307--1315. http://dblp.uni-trier.de/db/conf/kdd/kdd2011.html#ChenBAD11Google ScholarGoogle Scholar
  9. Francis Clarke. 2013. Functional analysis, calculus of variations and optimal control. Graduate Texts in Mathematics, Vol. 264. Springer Science & Business Media. https://doi.org/10.1007/978--1--4471--4820--3Google ScholarGoogle Scholar
  10. Robert M Corless, Gaston H Gonnet, and David EG Hare et. al. 1996. On the LambertW function. Advances in Computational mathematics , Vol. 5, 1 (1996), 329--359.Google ScholarGoogle Scholar
  11. Ying Cui, Ruofei Zhang, Wei Li, and Jianchang Mao. 2011. Bid landscape forecasting in online ad exchange marketplace.. In KDD , , Chid Apté, Joydeep Ghosh, and Padhraic Smyth (Eds.). ACM, 265--273. http://dblp.uni-trier.de/db/conf/kdd/kdd2011.html#CuiZLM11Google ScholarGoogle Scholar
  12. Steven Diamond and Stephen Boyd. 2016. CVXPY: A Python-embedded modeling language for convex optimization. Journal of Machine Learning Research , Vol. 17, 83 (2016), 1--5.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Joaquin Fernandez-Tapia, Olivier Guéant, and Jean-Michel Lasry. 2017. Optimal real-time bidding strategies. Applied Mathematics Research eXpress , Vol. 2017, 1 (2017), 142--183.Google ScholarGoogle Scholar
  14. Bruno Gaujal, Nicolas Navet, and Cormac Walsh. 2005. Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use. ACM Transactions on Embedded Computing Systems (TECS) , Vol. 4, 4 (2005), 907--933.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Aritra Ghosh, Saayan Mitra, and Somdeb Sarkhel et. al. 2020. Scalable Bid Landscape Forecasting in Real-time Bidding. CoRR , Vol. abs/2001.06587 (2020). http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-06587Google ScholarGoogle Scholar
  16. Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Vassilvitskii, and Martin Zinkevich. 2009. Adaptive bidding for display advertising.. In WWW, Juan Quemada, Gonzalo León, Yoëlle S. Maarek, and Wolfgang Nejdl (Eds.). ACM, 251--260. http://dblp.uni-trier.de/db/conf/www/www2009.html#GhoshRVZ09Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Nicolas Grislain, Nicolas Perrin, and Antoine Thabault. 2019. Recurrent Neural Networks for Stochastic Control in Real-Time Bidding.. In KDD , , Ankur Teredesai, Vipin Kumar, Ying Li, Rómer Rosales, Evimaria Terzi, and George Karypis (Eds.). ACM, 2801--2809. http://dblp.uni-trier.de/db/conf/kdd/kdd2019.html#GrislainPT19Google ScholarGoogle Scholar
  18. Ramki Gummadi, Peter B. Key, and Alexandre Proutière. 2011. Optimal bidding strategies in dynamic auctions with budget constraints.. In Allerton . IEEE, 588. http://dblp.uni-trier.de/db/conf/allerton/allerton2011.html#GummadiKP11Google ScholarGoogle ScholarCross RefCross Ref
  19. IAB. 2018. IAB internet advertising revenue report conducted by PricewaterhouseCoopers (PWC). https://www.iab.com/insightsGoogle ScholarGoogle Scholar
  20. Krishnamurthy Iyer, Ramesh Johari, and Mukund Sundararajan. 2014. Mean field equilibria of dynamic auctions with learning. Management Science , Vol. 60, 12 (2014), 2949--2970.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Niklas Karlsson. 2014. Adaptive control using Heisenberg bidding.. In ACC. IEEE, 1304--1309. http://dblp.uni-trier.de/db/conf/amcc/acc2014.html#Karlsson14Google ScholarGoogle ScholarCross RefCross Ref
  22. Niklas Karlsson. 2016. Control problems in online advertising and benefits of randomized bidding strategies. European Journal of Control , Vol. 30 (2016), 31--49.Google ScholarGoogle ScholarCross RefCross Ref
  23. Niklas Karlsson. 2017. Plant gain estimation in online advertising processes.. In CDC. IEEE, 2182--2187. http://dblp.uni-trier.de/db/conf/cdc/cdc2017.html#Karlsson17Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Vijay Krishna. 2002. Auction Theory .Academic Press.Google ScholarGoogle Scholar
  25. Wook Hyun Kwon and Soo Hee Han. 2006. Receding horizon control: model predictive control for state models .Springer Science & Business Media.Google ScholarGoogle Scholar
  26. Larry J Leblanc and Leon Cooper. 1974. The transportation-production problem. Transportation Science , Vol. 8, 4 (1974), 344--354.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Hairen Liao, Lingxiao Peng, Zhenchuan Liu, and Xuehua Shen. 2014. iPinYou Global RTB Bidding Algorithm Competition Dataset.. In [email protected] , , Esin Saka, Dou Shen, Kuang chih Lee, and Ying Li (Eds.). ACM, 6:1--6:6. http://dblp.uni-trier.de/db/conf/kdd/adkdd2014.html#LiaoPLS14Google ScholarGoogle Scholar
  28. Yishay Mansour, S. Muthukrishnan, and Noam Nisan. 2012. Doubleclick Ad Exchange Auction. CoRR , Vol. abs/1204.0535 (2012). http://dblp.uni-trier.de/db/journals/corr/corr1204.html#abs-1204-0535Google ScholarGoogle Scholar
  29. Flavio M Menezes and Paulo Klinger Monteiro. 2005. An introduction to auction theory .OUP Oxford.Google ScholarGoogle Scholar
  30. Adam Oberman. 2007. The convex envelope is the solution of a nonlinear obstacle problem. Proc. Amer. Math. Soc. , Vol. 135, 6 (2007), 1689--1694.Google ScholarGoogle ScholarCross RefCross Ref
  31. Art B. Owen. 2013. Monte Carlo theory, methods and examples . http://statweb.stanford.edu/ owen/mc/Google ScholarGoogle Scholar
  32. Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, and Foster J. Provost. 2012. Bid optimizing and inventory scoring in targeted online advertising.. In KDD , , Qiang Yang, Deepak Agarwal, and Jian Pei (Eds.). ACM, 804--812. http://dblp.uni-trier.de/db/conf/kdd/kdd2012.html#PerlichDHSRP12Google ScholarGoogle Scholar
  33. Ana Radovanovic and William D. Heavlin. 2012. Risk-aware revenue maximization in display advertising.. In WWW , , Alain Mille, Fabien L. Gandon, Jacques Misselis, Michael Rabinovich, and Steffen Staab (Eds.). ACM, 91--100. http://dblp.uni-trier.de/db/conf/www/www2012.html#RadovanovicH12Google ScholarGoogle Scholar
  34. Michael H. Schneider. 1986. Network flows and monotropic optimization. Networks , Vol. 16, 4 (1986), 441--443. http://dblp.uni-trier.de/db/journals/networks/networks16.html#Schneider86Google ScholarGoogle ScholarCross RefCross Ref
  35. J Frank Sharp, James C Snyder, and James H Greene. 1970. A decomposition algorithm for solving the multifacility production-transportation problem with nonlinear production costs. Econometrica: Journal of the Econometric Society (1970), 490--506.Google ScholarGoogle Scholar
  36. Elias M Stein and Rami Shakarchi. 2009. Real analysis: measure theory, integration, and Hilbert spaces .Princeton University Press.Google ScholarGoogle Scholar
  37. Erik Tillberg, Peter Marbach, and Ravi Mazumdar. 2020. An Optimal Bidding Algorithm for Online Ad Auctions with Overlapping Targeting Criteria. Proc. ACM Meas. Anal. Comput. Syst. , Vol. 4, 2 (6 2020). https://doi.org/10.1145/3366707Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Pauli Virtanen, Ralf Gommers, and Travis E. Oliphant et. al. 2020. SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python . Nature Methods , Vol. 17 (2020), 261--272.Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Jun Wang, Weinan Zhang, and Shuai Yuan. 2017. Display advertising with real-time bidding (RTB) and behavioural targeting. Foundations and Trends® in Information Retrieval , Vol. 11, 4--5 (2017), 297--435.Google ScholarGoogle ScholarCross RefCross Ref
  40. Yuchen Wang, Kan Ren, Weinan Zhang, Jun Wang, and Yong Yu. 2016. Functional Bid Landscape Forecasting for Display Advertising.. In ECML/PKDD (1) (Lecture Notes in Computer Science, Vol. 9851), Paolo Frasconi, Niels Landwehr, Giuseppe Manco, and Jilles Vreeken (Eds.). Springer, 115--131. http://dblp.uni-trier.de/db/conf/pkdd/pkdd2016--1.html#WangRZWY16Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Yining Wang and He Wang. 2020. Constant Regret Re-solving Heuristics for Price-based Revenue Management. arXiv preprint arXiv:2009.02861 (2020).Google ScholarGoogle Scholar
  42. Larry Wasserman. 2006. All of nonparametric statistics .Springer Science & Business Media. https://doi.org/10.1007/0--387--30623--4Google ScholarGoogle Scholar
  43. Di Wu, Xiujun Chen, and Xun Yang et. al. 2018a. Budget constrained bidding by model-free reinforcement learning in display advertising. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management . 1443--1451.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Wush Chi-Hsuan Wu, Mi-Yen Yeh, and Ming-Syan Chen. 2015. Predicting Winning Price in Real Time Bidding with Censored Data.. In KDD , , Longbing Cao, Chengqi Zhang, Thorsten Joachims, Geoffrey I. Webb, Dragos D. Margineantu, and Graham Williams (Eds.). ACM, 1305--1314. http://dblp.uni-trier.de/db/conf/kdd/kdd2015.html#WuYC15Google ScholarGoogle Scholar
  45. Wush Chi-Hsuan Wu, Mi-Yen Yeh, and Ming-Syan Chen. 2018b. Deep Censored Learning of the Winning Price in the Real Time Bidding.. In KDD , , Yike Guo and Faisal Farooq (Eds.). ACM, 2526--2535. http://dblp.uni-trier.de/db/conf/kdd/kdd2018.html#WuYC18Google ScholarGoogle Scholar
  46. Shuai Yuan, Jun Wang, and Xiaoxue Zhao. 2013. Real-time bidding for online advertising: measurement and analysis. In Proceedings of the Seventh International Workshop on Data Mining for Online Advertising . 1--8.Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Weinan Zhang, Yifei Rong, Jun Wang, Tianchi Zhu, and Xiaofan Wang. 2016a. Feedback Control of Real-Time Display Advertising.. In WSDM , , Paul N. Bennett, Vanja Josifovski, Jennifer Neville, and Filip Radlinski (Eds.). ACM, 407--416. http://dblp.uni-trier.de/db/conf/wsdm/wsdm2016.html#ZhangRWZW16Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Weinan Zhang and Jun Wang. 2015. Statistical Arbitrage Mining for Display Advertising.. In KDD , , Longbing Cao, Chengqi Zhang, Thorsten Joachims, Geoffrey I. Webb, Dragos D. Margineantu, and Graham Williams (Eds.). ACM, 1465--1474. http://dblp.uni-trier.de/db/conf/kdd/kdd2015.html#ZhangW15aGoogle ScholarGoogle ScholarDigital LibraryDigital Library
  49. Weinan Zhang, Shuai Yuan, and Jun Wang. 2014a. Optimal real-time bidding for display advertising.. In KDD , , Sofus A. Macskassy, Claudia Perlich, Jure Leskovec, Wei Wang, and Rayid Ghani (Eds.). ACM, 1077--1086. http://dblp.uni-trier.de/db/conf/kdd/kdd2014.html#ZhangYW14Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Weinan Zhang, Shuai Yuan, Jun Wang, and Xuehua Shen. 2014b. Real-time bidding benchmarking with ipinyou dataset. arXiv preprint arXiv:1407.7073 (2014).Google ScholarGoogle Scholar
  51. Weinan Zhang, Tianxiong Zhou, Jun Wang, and Jian Xu. 2016b. Bid-aware Gradient Descent for Unbiased Learning with Censored Data in Display Advertising.. In KDD, Balaji Krishnapuram, Mohak Shah, Alexander J. Smola, Charu C. Aggarwal, Dou Shen, and Rajeev Rastogi (Eds.). ACM, 665--674. http://dblp.uni-trier.de/db/conf/kdd/kdd2016.html#ZhangZWX16Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Wen-Yuan Zhu, Wen-Yueh Shih, and Ying-Hsuan Lee et. al. 2017. A gamma-based regression for winning price estimation in real-time bidding advertising.. In BigData , , Jian-Yun Nie, Zoran Obradovic, Toyotaro Suzumura, Rumi Ghosh, Raghunath Nambiar, Chonggang Wang, Hui Zang, Ricardo Baeza-Yates, Xiaohua Hu, Jeremy Kepner, Alfredo Cuzzocrea, Jian Tang, and Masashi Toyoda (Eds.). IEEE Computer Society, 1610--1619. http://dblp.uni-trier.de/db/conf/bigdataconf/bigdataconf2017.html#ZhuSLPH17Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Article Metrics

              • Downloads (Last 12 months)55
              • Downloads (Last 6 weeks)6

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!