Setting Reserve Prices in Second-Price Auctions with Unobserved Bids

References

• Adikari S, Dutta K (2019) A new approach to real-time bidding in online advertisements: Auto pricing strategy. INFORMS J. Comput. 31(1):66–82.Link, Google Scholar
• Agrawal S, Goyal N (2012) Analysis of Thompson sampling for the multi-armed bandit problem. Mannor S, Srebro N, Williamson RC, eds. Proc. 25th Annual Conf. Learn. Theory (PMLR), 39.1–39.26.Google Scholar
• Amin K, Rostamizadeh A, Syed U (2013) Learning prices for repeated auctions with strategic buyers. Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds. Proc. 26th Internat. Conf. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 1169–1177.Google Scholar
• Audibert J-Y, Bubeck S (2010) Regret bounds and minimax policies under partial monitoring. J. Machine Learn. Res. 11:2785–2836.Google Scholar
• Audibert J-Y, Munos R, Szepesvári C (2009) Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoret. Comput. Sci. 410(19):1876–1902.Crossref, Google Scholar
• Auer P (2003) Using confidence bounds for exploitation-exploration trade-offs. J. Machine Learn. Res. 3:397–422.Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002a) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Auer P, Cesa-Bianchi N, Freund Y, Schapire R (2002b) The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1):48–77.Crossref, Google Scholar
• Austin D, Seljan S, Monello J, Tzeng S (2016) Reserve price optimization at scale. Proc. 3rd IEEE Internat. Conf. Data Sci. Adv. Analytics (IEEE, Piscataway, NJ), 528–536.Google Scholar
• Balseiro SR, Besbes O, Weintraub GY (2015) Repeated auctions with budgets in ad exchanges: Approximations and design. Management Sci. 61(4):864–884.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
• Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Google Scholar
• Besbes O, Gur Y, Zeevi A (2019) Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards. Stochastic Systems 9(4):319–337.Link, Google Scholar
• Bishop CM (2006) Pattern Recognition and Machine Learning (Springer-Verlag, Berlin).Google Scholar
• Bouneffouf D, Féraud R (2016) Multi-armed bandit problem with known trend. Neurocomputing 205(September):16–21.Crossref, Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations Trends Machine Learn. 5(1):1–122.Crossref, Google Scholar
• Cao Y, Wen Z, Kveton B, Xie Y (2019) Nearly optimal adaptive procedure with change detection for piecewise-stationary bandit. Chaudhuri K, Sugiyama M, eds. Proc. 22nd Internat. Conf. Artificial Intelligence Statist. (PMLR), 418–427.Google Scholar
• Caron S, Kveton B, Lelarge M, Bhagat S (2012) Leveraging side observations in stochastic bandits. de Freitas N, Murphy K, eds. Proc. 28th Conf. Uncertainty Artificial Intelligence (AUAI Press, Arlington, VA), 142–151.Google Scholar
• Cesa-Bianchi N, Gentile C, Mansour Y (2015) Regret minimization for reserve prices in second-price auctions. IEEE Trans. Inform. Theory 61(1):549–564.Crossref, Google Scholar
• Chahuara P, Grislain N, Jauvion G, Renders J-M (2017) Real-time optimization of web publisher RTB revenues. ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1743–1751.Google Scholar
• Cheung WC, Simchi-Levi D, Wang H (2017) Dynamic pricing and demand learning with limited price experimentation. Oper. Res. 65(6):1722–1731.Link, Google Scholar
• Choi WJ, Sayedi A (2019) Learning in online advertising. Marketing Sci. 38(4):584–608.Link, Google Scholar
• Choi H, Mela CF, Balseiro SR, Leary A (2020) Online display advertising markets: A literature review and future directions. Inform. Systems Res. 31(2):556–575.Link, Google Scholar
• Combes R, Proutiere A (2014) Unimodal bandits: Regret lower bounds and optimal algorithms. Xing EP, Jebara T, eds. Proc. 31st Internat. Conf. Machine Learn. (PMLR), I-521–I-529.Google Scholar
• Degenne R, Perchet V (2016) Anytime optimal algorithms in stochastic multi-armed bandits. Balcan MF, Weinberger KQ, eds. Proc. 33rd Internat. Conf. Machine Learn. (PMLR), 1587–1595.Google Scholar
• Degenne R, Garcelon E, Perchet V (2018) Bandits with side observations: Bounded vs. logarithmic regret. Conf. Uncertainty in Artificial Intelligence. http://auai.org/uai2018/proceedings/papers/182.pdf.Google Scholar
• den Boer AV (2015) Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Management Sci. 20(1):1–18.Crossref, Google Scholar
• den Boer AV, Zwart B (2014) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.Link, Google Scholar
• den Boer AV, Zwart B (2015) Dynamic pricing and learning with finite inventories. Oper. Res. 63(4):965–978.Link, Google Scholar
• Drutsa A (2017) Horizon-independent optimal pricing in repeated auctions with truthful and strategic buyers. Proc. 26th Internat. Conf. World Wide Web (International World Wide Web Conferences Steering Committee, Geneva), 33–42.Google Scholar
• Drutsa A (2018) Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer. Dy J, Krause A, eds. Proc. 35th Internat. Conf. Machine Learn. (PMLR), 1319–1328.Google Scholar
• eBay (2020) How reserve prices work. Accessed February 15, 2020, https://www.ebay.com/help/buying/bidding/reserve-prices-work?id=4018.Google Scholar
• Garivier A, Cappé O (2011) The KL-UCB algorithm for bounded stochastic bandits and beyond. Kakade SM, von Luxburg U, eds. Proc. 24th Annual Conf. Learn. Theory (PMLR), 359–376.Google Scholar
• Google (2020) Google Ad Manager report metrics. Accessed October 22, 2020, https://support.google.com/admanager/table/7568664.Google Scholar
• Huang Z, Liu J, Wang X (2018) Learning optimal reserve price against non-myopic bidders. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Proc. 32nd Internat. Conf. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 2042–2052.Google Scholar
• IAB Technology Laboratory (2016) OpenRTB API specification version 2.5. Accessed October 22, 2020, https://www.iab.com/wp-content/uploads/2016/03/OpenRTB-API-Specification-Version-2-5-FINAL.pdf/.Google Scholar
• Jank W, Zhang S (2011) An automated and data-driven bidding strategy for online auctions. INFORMS J. Comput. 23(2):238–253.Link, Google Scholar
• Javanmard A (2017) Perishability of data: Dynamic pricing under varying-coefficient models. J. Machine Learn. Res. 18(53):1–31.Google Scholar
• Keskin NB, Zeevi A (2017) Chasing demand: Learning and earning in a changing environment. Math. Oper. Res. 42(2):277–307.Link, Google Scholar
• Kleinberg R, Leighton T (2003) The value of knowing a demand curve: Bounds on regret for online posted-price auctions. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 594–605.Google Scholar
• Krishna V (2009) Auction Theory, 2nd ed. (Academic Press, Burlington, MA).Google Scholar
• Lattimore T (2015) Optimally confident UCB: Improved regret for finite-armed bandits. Preprint, submitted July 28, http://arxiv.org/abs/1507.07880.Google Scholar
• Li J, Ni X, Yuan Y, Qin R, Wang X, Wang F-Y (2017) The impact of reserve price on publisher revenue in real-time bidding advertising markets. 2017 IEEE Internat. Conf. Systems, Man, Cybernetics (IEEE, Piscataway, NJ), 1256–1261.Google Scholar
• Mannor S, Shamir O (2011) From bandits to experts: On the value of side-observations. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira F, Weinberger KQ, eds. Proc. 24th Internat. Conf. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 684–692.Google Scholar
• Mao W, Zheng Z, Wu F, Chen G (2018) Online pricing for revenue maximization with unknown time discounting valuations. Lang J, ed. Proc. 27th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 440–446.Google Scholar
• Misra K, Schwartz EM, Abernethy J (2019) Dynamic online pricing with incomplete information using multiarmed bandit experiments. Marketing Sci. 38(2):226–252.Link, Google Scholar
• Mohri M, Munoz A (2014) Optimal regret minimization in posted-price auctions with strategic buyers. Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems, Vol. 27 (Curran Associates, Red Hook, NY), 1871–1879.Google Scholar
• Mohri M, Muñoz Medina A (2016) Learning algorithms for second-price auctions with reserve. J. Machine Learn. Res. 17(1):2632–2656.Google Scholar
• Ostrovsky M, Schwarz M (2011) Reserve prices in internet advertising auctions: A field experiment. Proc. 12th ACM Conf. Electronic Commerce (ACM, New York), 59–60.Google Scholar
• Paladino S, Trovò F, Restelli M, Gatti N (2017) Unimodal Thompson sampling for graph-structured arms. Proc. 31st AAAI Conf. Artificial Intelligence (Association for the Advancement of Artificial Intelligence, Menlo Park, CA), 2457–2463.Google Scholar
• Rhuggenaath J, Akcay A, Zhang Y, Kaymak U (2019a) Fuzzy logic based pricing combined with adaptive search for reserve price optimization in online ad auctions. IEEE Internat. Conf. Fuzzy Systems (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Rhuggenaath J, Akcay A, Zhang Y, Kaymak U (2019b) Optimizing reserve prices for publishers in online ad auctions. IEEE Conf. Comput. Intelligence Financial Engrg. Econom. (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Rhuggenaath J, Akcay A, Zhang Y, Kaymak U (2019c) A PSO-based algorithm for reserve price optimization in online ad auctions. IEEE Congress Evolutionary Comput. (IEEE, Piscataway, NJ), 2611–2619.Google Scholar
• Rudolph MR, Ellis JG, Blei DM (2016) Objective variables for probabilistic revenue maximization in second-price auctions with reserve. Proc. 25th Internat. Conf. World Wide Web (ACM, New York), 1113–1122.Google Scholar
• Sayedi A (2018) Real-time bidding in online display advertising. Marketing Sci. 37(4):553–568.Link, Google Scholar
• Shen W, Lahaie S, Leme RP (2019) Learning to clear the market. Chaudhuri K, Salakhutdinov R, eds. Proc. 36th Internat. Conf. Machine Learn., Vol. 97 (PMLR), 5710–5718.Google Scholar
• Sun Y, Zhou Y, Yin M, Deng X (2012) On the convergence and robustness of reserve pricing in keyword auctions. Proc. 14th Internat. Conf. Electronic Commerce (ACM, New York), 113–120.Google Scholar
• Trovò F, Paladino S, Restelli M, Gatti N (2018) Improving multi-armed bandit algorithms in online pricing settings. Internat. J. Approximate Reasoning 98(July):196–235.Crossref, Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Crossref, Google Scholar
• Wang J, Zhang W, Yuan S (2017) Display advertising with real-time bidding (RTB) and behavioural targeting. Foundations Trends Inform. Retrieval 11(4–5):297–435.Crossref, Google Scholar
• Wu W, Yeh MY, Chen MS (2018) Deep censored learning of the winning price in the real time bidding. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 2526–2535.Google Scholar
• Xie Z, Lee K-C, Wang L (2017) Optimal reserve price for online ads trading based on inventory identification. Proc. ADKDD’17 (ACM, New York), 6:1–6:7.Google Scholar
• Yang Y, Zeng D, Yang Y, Zhang J (2015) Optimal budget allocation across search advertising markets. INFORMS J. Comput. 27(2):285–300.Link, Google Scholar
• Yuan S, Wang J, Chen B, Mason P, Seljan S (2014) An empirical study of reserve price optimisation in real-time bidding. ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1897–1906.Google Scholar
• Zhao H, Chen W (2020) Online second price auction with semi-bandit feedback under the non-stationary setting. Proc. 34th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 6893–6900.Google Scholar
• Zhu W-Y, Shih W-Y, Lee Y-H, Peng W-C, Huang J-L (2017) A gamma-based regression for winning price estimation in real-time bidding advertising. Nie J-Y, Obradovic Z, Suzumura T, Ghosh R, Nambiar R, Wang C, Zang H, et al., eds. 2017 IEEE Internat. Conf. Big Data (IEEE, Piscataway, NJ), 1610–1619.Google Scholar