Fetching the paper…
Reading the bibliography…
We define a general framework for a large class of combinatorial multi-armed bandit (CMAB) problems, where subsets of base arms with unknown distributions form super arms.
Probability inequalities for sums of bounded random variables
Hoeffding, Wassily · 1963
Earlier work this paper cites.
An analysis of the approximations for maximizing submodular set functions
Nemhauser, G. L., Wolsey, L. A., and Fisher, M. L · 1978
Earlier work this paper cites.
Bandit problems: Sequential Allocation of Experiments
Berry, Donald A. and Fristedt, Bert · 1985
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Lai, Tze Leung and Robbins, Herbert · 1985
Earlier work this paper cites.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays — Part I: i.i.d. rewards
Anantharam, Venkatachalam, Varaiya, Pravin, and Walrand, Jean · 1987
Earlier work this paper cites.
The continuum-armed bandit problem
Agrawal, Rajeev · 1995
Earlier work this paper cites.
Reinforcement Learning: An Introduction
Sutton, Richard S. and Barto, Andrew G · 1998
Earlier work this paper cites.
Maximizing the spread of influence through a social network
Kempe, David, Kleinberg, Jon M., and Tardos, Éva · 2003
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
Kleinberg, Robert D · 2004
Earlier work this paper cites.
Approximation Algorithms
Vazirani, Vijay V · 2004
Earlier work this paper cites.
Probability and Computing
Mitzenmacher, Michael and Upfal, Eli · 2005
Earlier work this paper cites.
Dynamic assortment with demand learning for seasonal consumer goods
Caro, Felipe and Gallien, Jérémie · 2007
Earlier work this paper cites.
Multi-armed bandits in metric spaces
Kleinberg, Robert, Slivkins, Aleksandrs, and Upfal, Eli · 2008
Cited alongside, same era.
Learning diverse rankings with multi-armed bandits
Radlinski, Filip, Kleinberg, Robert, and Joachims, Thorsten · 2008
Cited alongside, same era.
An online algorithm for maximizing submodular functions
Streeter, Matthew and Golovin, Daniel · 2008
Cited alongside, same era.
Minimax policies for adversarial and stochastic bandits
Audibert, Jean-Yves, Bubeck, Sébastien, and Lugosi, Gábor · 2009
Cited alongside, same era.
Combinatorial bandits
Cesa-Bianchi, Nicolò and Lugosi, Gábor · 2009
Cited alongside, same era.
Online submodular minimization
Hazan, Elad and Kale, Satyen · 2009
Cited alongside, same era.
Logarithmic weak regret of non-bayesian restless multi-armed bandit
Liu, Haoyang, Liu, Keqin, and Zhao, Qing · 2011
Later among the works it cites.
From bandits to experts: On the value of side-observations
Mannor, Shie and Shamir, Ohad · 2011
Later among the works it cites.
Towards minimax policies for online linear optimization with bandit feedback
Bubeck, Sébastien, Cesa-Bianchi, Nicolò, and Kakade, Sham M · 2012
Later among the works it cites.
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Gai, Yi, Krishnamachari, Bhaskar, and Jain, Rahul · 2012
Later among the works it cites.
Adaptive shortest-path routing under unknown and stochastically varying link states
Liu, Keqin and Zhao, Qing · 2012
Later among the works it cites.
Combinatorial multi-armed bandit: General framework, results, and applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kakade, Sham M., Kalai, Adam Tauman, and Ligett, Katrina · 2009
Cited alongside, same era.
Online learning of assignments
Streeter, Matthew, Golovin, Daniel, and Krause, Andreas · 2009
Cited alongside, same era.
Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation
Gai, Yi, Krishnamachari, Bhaskar, and Jain, Rahul · 2010
Cited alongside, same era.
Minimax policies for combinatorial prediction games
Audibert, Jean-Yves, Bubeck, Sébastien, and Lugosi, Gábor · 2011
Cited alongside, same era.
The KL-UCB algorithm for bounded stochastic bandits and beyond
Garivier, Aurélien and Cappé, Olivier · 2011
Cited alongside, same era.
Finite-time analysis of the multiarmed bandit problem
Auer, Peter, Cesa-Bianchi, Nicolò, and Fischer, Paul
Cited in the paper.
Chen, Wei, Wang, Yajun, and Yuan, Yang · 2013
Later among the works it cites.
Thompson sampling for complex online problems
Gopalan, Aditya, Mannor, Shie, and mansour, Yishay · 2014
Closest in time.
Matroid bandits: Fast combinatorial optimization with learning
Kveton, Branislav, Wen, Zheng, Ashkan, Azin, Eydgahi, Hoda, and Eriksson, Brian · 2014
Closest in time.
Combinatorial partial monitoring game with linear feedback and its applications
Lin, Tian, Abrahao, Bruno, Kleinberg, Robert, Lui, John C. S., and Chen, Wei · 2014
Closest in time.
Contextual combinatorial bandit and its application on diversified online recommendation
Qin, Lijing, Chen, Shouyuan, and Zhu, Xiaoyan · 2014
Closest in time.
Tight regret bounds for stochastic combinatorial semi-bandits
Kveton, Branislav, Wen, Zheng, Ashkan, Azin, and Szepesvári, Csaba · 2015
Closest in time.