Fetching the paper…
Reading the bibliography…
The web link selection problem is to select a small subset of web links from a large web link pool, and to place the selected links on a web page that can only accommodate a limited number of links, e.g., advertisements, recommendations, or news feeds.
Weighted sums of certain dependent random variables
Kazuoki Azuma · 1967
Earlier work this paper cites.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-part i: Iid rewards
Venkatachalam Anantharam, Pravin Varaiya, and Jean Walrand · 1987
Earlier work this paper cites.
Unintrusive customization techniques for web advertising
Marc Langheinrich, Atsuyoshi Nakamura, Naoki Abe, Tomonari Kamba, and Yoshiyuki Koseki · 1999
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
The impact of content and design elements on banner advertising click-through rates
Ritu Lohtia, Naveen Donthu, and Edmund K Hershberger · 2003
Earlier work this paper cites.
Decision making in multi-agent systems
Karen Arman Pivazyan · 2004
Earlier work this paper cites.
Dependent rounding and its applications to approximation algorithms
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan · 2006
Earlier work this paper cites.
Multi-armed bandits in metric spaces
Robert Kleinberg, Aleksandrs Slivkins, and Eli Upfal · 2008
Earlier work this paper cites.
An analysis of private browsing modes in modern browsers
Gaurav Aggarwal, Elie Bursztein, Collin Jackson, and Dan Boneh · 2010
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation
L. Li, W. Chu, J. Langford, and R.E. Schapire · 2010
Earlier work this paper cites.
Algorithms for adversarial bandit problems with multiple plays
T. Uchiya, A. Nakamura, and M. Kudo · 2010
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck, Nicolo Cesa-Bianchi, et al · 2012
Earlier work this paper cites.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Cited alongside, same era.
Combinatorial multi-armed bandit: General framework, results and applications
Wei Chen, Yajun Wang, and Yang Yuan · 2013
Cited alongside, same era.
Multi-armed bandit with budget constraint and variable costs
Wenkui Ding, Tao Qin, Xu-Dong Zhang, and Tie-Yan Liu · 2013
Cited alongside, same era.
Bandits with concave rewards and convex knapsacks
Shipra Agrawal and Nikhil R. Devanur · 2014
Cited alongside, same era.
Seven rules of thumb for web site experimenters
Ron Kohavi, Alex Deng, Roger Longbotham, and Ya Xu · 2014
Cited alongside, same era.
Why cost per acquisition is the only metric that really matters, 2014
Jason Spooner · 2014
Cited alongside, same era.
Harvardx and mitx: Four years of open online courses–fall 2012-summer 2016
Isaac Chuang and Andrew Dean Ho · 2016
Later among the works it cites.
A survey of active learning in collaborative filtering recommender systems
Mehdi Elahi, Francesco Ricci, and Neil Rubens · 2016
Later among the works it cites.
Coupon purchase data, 2016
Kaggle · 2016
Later among the works it cites.
Multiple-play bandits in the position-based model
Paul Lagrée, Claire Vernade, and Olivier Cappe · 2016
Later among the works it cites.
Collaborative filtering bandits
Shuai Li, Alexandros Karatzoglou, and Claudio Gentile · 2016
Later among the works it cites.
An optimal algorithm for the thresholding bandit problem
Andrea Locatelli, Maurilio Gutzeit, and Alexandra Carpentier · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Avito context ad clicks, 2015
Kaggle · 2015
Cited alongside, same era.
Optimal regret analysis of thompson sampling in stochastic multi-armed bandit problem with multiple plays
J. Komiyama, J. Hondaand, and H. Nakagawa · 2015
Cited alongside, same era.
Optimization Issues in Web and Mobile Advertising: Past and Future Trends
Subodha Kumar · 2015
Cited alongside, same era.
Algorithms with logarithmic or sublinear regret for constrained contextual bandits
Huasen Wu, R Srikant, Xin Liu, and Chong Jiang · 2015
Cited alongside, same era.
From infrastructure to culture: A/b testing challenges in large scale social networks
Ya Xu, Nanyu Chen, Addrian Fernandez, Omar Sinno, and Anmol Bhasin · 2015
Cited alongside, same era.
Collaborative filtering with low regret
Guy Bresler, Devavrat Shah, and Luis Filipe Voloch · 2016
Cited alongside, same era.
Trackmeornot: Enabling flexible control on web tracking
Wei Meng, Byoungyoung Lee, Xinyu Xing, and Wenke Lee · 2016
Later among the works it cites.
Optimizing performance-based internet advertisement campaigns
Radha Mookerjee, Subodha Kumar, and Vijay S Mookerjee · 2016
Later among the works it cites.
Budgeted multi-armed bandits with multiple plays
Yingce Xia, Tao Qin, Weidong Ma, Nenghai Yu, and Tie-Yan Liu · 2016
Later among the works it cites.
Multi-level feedback web links selection problem: Learning and optimization
Kechao Cai, Kun Chen, Longbo Huang, and John C. S. Lui · 2017
Later among the works it cites.
Trustworthy analysis of online a/b tests: Pitfalls, challenges and solutions
Alex Deng, Jiannan Lu, and Jonthan Litz · 2017
Later among the works it cites.