{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:27:29Z","timestamp":1755926849457,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645504","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"3586-3597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Best of Three Worlds: Adaptive Experimentation for Digital Marketing in Practice"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0005-3009","authenticated-orcid":false,"given":"Tanner","family":"Fiez","sequence":"first","affiliation":[{"name":"Amazon, Seattle, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0236-2385","authenticated-orcid":false,"given":"Houssam","family":"Nassif","sequence":"additional","affiliation":[{"name":"Meta, Seattle, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7438-8693","authenticated-orcid":false,"given":"Yu-Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0223-521X","authenticated-orcid":false,"given":"Sergio","family":"Gamez","sequence":"additional","affiliation":[{"name":"Amazon, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1087-724X","authenticated-orcid":false,"given":"Lalit","family":"Jain","sequence":"additional","affiliation":[{"name":"Amazon & University of Washington, Seattle, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Conference on Learning Theory. 918--949","author":"Abbasi-Yadkori Yasin","year":"2018","unstructured":"Yasin Abbasi-Yadkori, Peter Bartlett, Victor Gabillon, Alan Malek, and Michal Valko. 2018. Best of both worlds: Stochastic & adversarial best-arm identification. In Conference on Learning Theory. 918--949."},{"key":"e_1_3_2_2_2_1","volume-title":"Conference on Learning Theory. 41--53","author":"Audibert Jean-Yves","year":"2010","unstructured":"Jean-Yves Audibert, S\u00e9bastien Bubeck, and R\u00e9mi Munos. 2010. Best arm identification in multi-armed bandits. In Conference on Learning Theory. 41--53."},{"key":"e_1_3_2_2_3_1","volume-title":"International Conference on Artificial Intelligence and Statistics. 1988--1996","author":"Degenne R\u00e9my","year":"2019","unstructured":"R\u00e9my Degenne, Thomas Nedelec, Clement Calauzenes, and Vianney Perchet. 2019. Bridging the gap between regret minimization and best arm identification, with application to A\/B tests. In International Conference on Artificial Intelligence and Statistics. 1988--1996."},{"key":"e_1_3_2_2_4_1","volume-title":"Efficient inference without trading-off regret in bandits: An allocation probability test for Thompson sampling. arXiv preprint arXiv:2111.00137","author":"Deliu Nina","year":"2021","unstructured":"Nina Deliu, Joseph J Williams, and Sofia S Villar. 2021. Efficient inference without trading-off regret in bandits: An allocation probability test for Thompson sampling. arXiv preprint arXiv:2111.00137 (2021)."},{"key":"e_1_3_2_2_5_1","volume-title":"International Conference on Machine Learning. 1194--1203","author":"Deshpande Yash","year":"2018","unstructured":"Yash Deshpande, Lester Mackey, Vasilis Syrgkanis, and Matt Taddy. 2018. Accurate inference for adaptive linear models. In International Conference on Machine Learning. 1194--1203."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248586"},{"key":"e_1_3_2_2_7_1","volume-title":"Adaptive Experimental Design and Counterfactual Inference. In Workshops of Conference on Recommender Systems.","author":"Fiez Tanner","year":"2022","unstructured":"Tanner Fiez, Sergio Gamez, Arick Chen, Houssam Nassif, and Lalit Jain. 2022. Adaptive Experimental Design and Counterfactual Inference. In Workshops of Conference on Recommender Systems."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Tanner Fiez Houssam Nassif Yu-Cheng Chen Sergio Gamez and Lalit Jain. 2024. Best of Three Worlds: Adaptive Experimentation for Digital Marketing in Practice. arxiv: 2402.10870","DOI":"10.1145\/3589334.3645504"},{"key":"e_1_3_2_2_9_1","unstructured":"Sinong Geng Houssam Nassif and Carlos A Manzanares. 2023. A Data-Driven State Aggregation Approach for Dynamic Discrete Choice Models. In Uncertainty in Artificial Intelligence (UAI). 647--657."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2014602118"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1991"},{"key":"e_1_3_2_2_13_1","volume-title":"Conference on Learning Theory. 423--439","author":"Jamieson Kevin","year":"2014","unstructured":"Kevin Jamieson, Matthew Malloy, Robert Nowak, and S\u00e9bastien Bubeck. 2014. lil'ucb: An optimal exploration algorithm for multi-armed bandits. In Conference on Learning Theory. 423--439."},{"key":"e_1_3_2_2_14_1","first-page":"3660","article-title":"A bandit approach to sequential experimental design with false discovery control","volume":"31","author":"Jamieson Kevin G","year":"2018","unstructured":"Kevin G Jamieson and Lalit Jain. 2018. A bandit approach to sequential experimental design with false discovery control. Advances in Neural Information Processing Systems , Vol. 31 (2018), 3660--3670.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_15_1","unstructured":"Jimmy Jin and Leio Pekelis. 2018. Acceleration of A\/B\/n Testing under time-varying signals. (2018)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3097992"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946646"},{"volume-title":"Trustworthy online controlled experiments: A practical guide to a\/b testing","author":"Kohavi Ron","key":"e_1_3_2_2_18_1","unstructured":"Ron Kohavi, Diane Tang, and Ya Xu. 2020. Trustworthy online controlled experiments: A practical guide to a\/b testing. Cambridge University Press."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599875"},{"volume-title":"Bandit algorithms","author":"Lattimore Tor","key":"e_1_3_2_2_20_1","unstructured":"Tor Lattimore and Csaba Szepesv\u00e1ri. 2020. Bandit algorithms. Cambridge University Press."},{"key":"e_1_3_2_2_21_1","volume-title":"Estimation of subsidiary performance metrics under optimal policies. arXiv preprint","author":"Li Zhaoqi","year":"2024","unstructured":"Zhaoqi Li, Houssam Nassif, and Alex Luedtke. 2024. Estimation of subsidiary performance metrics under optimal policies. arXiv preprint (2024)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4136"},{"key":"e_1_3_2_2_23_1","volume-title":"Adaptivity and confounding in multi-armed bandit experiments. arXiv preprint arXiv:2202.09036","author":"Qin Chao","year":"2022","unstructured":"Chao Qin and Daniel Russo. 2022. Adaptivity and confounding in multi-armed bandit experiments. arXiv preprint arXiv:2202.09036 (2022)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696786"},{"key":"e_1_3_2_2_25_1","volume-title":"Conference on Learning Theory. 1417--1418","author":"Russo Daniel","year":"2016","unstructured":"Daniel Russo. 2016. Simple bayesian algorithms for best arm identification. In Conference on Learning Theory. 1417--1418."},{"key":"e_1_3_2_2_26_1","volume-title":"Abbas Kazerouni, Ian Osband, Zheng Wen, et al.","author":"Russo Daniel J","year":"2018","unstructured":"Daniel J Russo, Benjamin Van Roy, Abbas Kazerouni, Ian Osband, Zheng Wen, et al. 2018. A Tutorial on Thompson Sampling. Foundations and Trends\u00ae in Machine Learning, Vol. 11, 1 (2018), 1--96."},{"key":"e_1_3_2_2_27_1","volume-title":"Contextual Multi-Armed Bandits for Causal Marketing. In Workshops of International Conference on Machine Learning (ICML).","author":"Sawant Neela","year":"2018","unstructured":"Neela Sawant, Chitti Babu Namballa, Narayanan Sadagopan, and Houssam Nassif. 2018. Contextual Multi-Armed Bandits for Causal Marketing. In Workshops of International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1361249"},{"key":"e_1_3_2_2_29_1","volume-title":"Experimental Designs for Heteroskedastic Variance. In Conference on Neural Information Processing Systems (NeurIPS).","author":"Weltz Justin","year":"2023","unstructured":"Justin Weltz, Tanner Fiez, Alexander Volfovsky, Eric Laber, Blake Mason, Houssam Nassif, and Lalit Jain. 2023. Experimental Designs for Heteroskedastic Variance. In Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_2_30_1","volume-title":"International Conference on Artificial Intelligence and Staistics.","author":"Xiong Zhihan","year":"2024","unstructured":"Zhihan Xiong, Romain Camilleri, Maryam Fazel, Lalit Jain, and Kevin Jamieson. 2024. A\/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity. International Conference on Artificial Intelligence and Staistics."},{"key":"e_1_3_2_2_31_1","volume-title":"Inference for batched bandits. Advances in neural information processing systems","author":"Zhang Kelly","year":"2020","unstructured":"Kelly Zhang, Lucas Janson, and Susan Murphy. 2020. Inference for batched bandits. Advances in neural information processing systems , Vol. 33 (2020), 9818--9829."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Singapore Singapore","acronym":"WWW '24"},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:32:09Z","timestamp":1755822729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":31,"alternative-id":["10.1145\/3589334.3645504","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645504","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}