Combinatorial multi-armed bandit: General framework, results and applications

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 151-159

  Chen, Wei ^a   Wang, Yajun ^a   Yuan, Yang ^b  

^a MICROSOFT RESEARCH ASIA   (China)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; LEARNING SYSTEMS; MARKETING; OPTIMIZATION;

CONSTANT FACTORS; MAXIMUM COVERAGE; MULTI ARMED BANDIT; NEW APPLICATIONS; ONLINE ADVERTISING; REWARD FUNCTION; SOCIAL INFLUENCE; VIRAL MARKETING;

PROBABILITY DISTRIBUTIONS;

EID: 84897515317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Anantharam, V., Varaiya, P., and Walrand, J. Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays Part I: i.i.d. rewards; Part II: Markovian rewards. IEEE Transactions on Automatic Control, AC-32(11):968-982, 1987a.
2. Audibert, J.-Y., and Bubeck, S. Minimax policies for adversarial and stochastic bandits. In COLT, 2009.
3. Audibert, J.-Y., Bubeck, S., and Lugosi, G. Minimax policies for combinatorial prediction games. In COLT, 2011.
4. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002a. (Pubitemid 34126111)
5. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1):48-77, 2002b.
6. Berry, D. and Fristedt, B. Bandit problems. Chapman and Hall, 1985.
7. Bubeck, S., Cesa-Bianchi, N., and Kakade, S. M. Towards Minimax Policies for Online Linear Optimization with Bandit Feedback. In COLT, 2012.
8. Caro, F. and Gallien, J. Dynamic assortment with demand learning for seasonal consumer goods. Management Science, 53:276-292, 2007. (Pubitemid 46326180)
9. Cesa-Bianchi, N. and Lugosi, G. Combinatorial bandits.
10. Gai, Y., Krishnamachari, B., and Jain, R. Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation. In DySPAN, 2010.
11. Gai, Y., Krishnamachari, B., and Jain, R. Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations. IEEE/ACM Transactions on Networking, 20, 2012.
12. Garivier, A. and Cappé, O. The KL-UCB algorithm for bounded stochastic bandits and beyond. In COLT, 2011.
13. Hazan, E. and Kale, S. Online submodular minimization. In NIPS, 2009.
14. Kakade, S. M., Kalai, A. T., and Ligett, K. Playing games with approximation algorithms. SIAM Journal on Computing, 39(3):1088-1106, 2009.
15. Kempe, D., Kleinberg, J. M., and Tardos, E. Maximizing the spread of influence through a social network. In KDD, 2003.
16. Lai, T. L. and Robbins, H. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4-22, 1985.
17. Liu, H., Liu, K., and Zhao, Q. Logarithmic weak regret of non-bayesian restless multi-armed bandit. In ICASSP, 2011.
18. Liu, K. and Zhao, Q. Adaptive shortest-path routing under unknown and stochastically varying link states. Arxiv preprint arXiv:1201.4906, 2012.
19. Mannor, S., and Shamir, O. From Bandits to Experts: On the Value of Side-Observations. In NIPS, 2011.
20. Nemhauser, G., Wolsey, L., and Fisher, M. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
21. Radlinski, F., Kleinberg, R., and Joachims, T. Learning diverse rankings with multi-armed bandits. In ICML, 2008.
22. Streeter, M., Golovin, D., and Krause, A. Online learning of assignments. In NIPS, 2009.
23. Streeter, M. and Golovin, D. An online algorithm for maximizing submodular functions. In NIPS, 2008.
24. Sutton, R. and Barto, A. Reinforcement learning, an introduction. MIT Press, 1998.
25. Vazirani, V. V. Approximation Algorithms Springer, 2004