Fetching the paper…
Reading the bibliography…
We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to.
An analysis of approximations for maximizing submodular set functions
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher · 1978
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T. L. Lai and H. Robbins · 1985
Earlier work this paper cites.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-part i: Iid rewards
V. Anantharam, P. Varaiya, and J. Walrand · 1987
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, and P. Fischer · 2002
Earlier work this paper cites.
Maximizing the spread of influence through a social network
D. Kempe, J. Kleinberg, and É. Tardos · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Cost-effective outbreak detection in networks
J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance · 2007
Earlier work this paper cites.
Prediction of information diffusion probabilities for independent cascade model
K. Saito, R. Nakano, and M. Kimura · 2008
Earlier work this paper cites.
Efficient influence maximization in social networks
W. Chen, Y. Wang, and S. Yang · 2009
Earlier work this paper cites.
Scalable influence maximization for prevalent viral marketing in large-scale social networks
W. Chen, C. Wang, and Y. Wang · 2010
Earlier work this paper cites.
Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation
Y. Gai, B. Krishnamachari, and R. Jain · 2010
Earlier work this paper cites.
Inferring networks of diffusion and influence
M. Gomez Rodriguez, J. Leskovec, and A. Krause · 2010
Cited alongside, same era.
Learning influence probabilities in social networks
A. Goyal, F. Bonchi, and L. V. Lakshmanan · 2010
Cited alongside, same era.
Minimax policies for combinatorial prediction games
J.-Y. Audibert, S. Bubeck, and G. Lugosi · 2011
Cited alongside, same era.
Pure exploration in finitely-armed and continuous-armed bandits
S. Bubeck, R. Munos, and G. Stoltz · 2011
Cited alongside, same era.
An empirical evaluation of thompson sampling
O. Chapelle and L. Li · 2011
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Scalable influence maximization for independent cascade model in large-scale social networks
C. Wang, W. Chen, and Y. Wang · 2012
Later among the works it cites.
Topic-aware social influence propagation models
N. Barbieri, F. Bonchi, and G. Manco · 2013
Later among the works it cites.
Information and influence propagation in social networks
W. Chen, L. V. Lakshmanan, and C. Castillo · 2013
Later among the works it cites.
Combinatorial multi-armed bandit: General framework and applications
W. Chen, Y. Wang, and Y. Yuan · 2013
Later among the works it cites.
Combinatorial pure exploration of multi-armed bandits
S. Chen, T. Lin, I. King, M. R. Lyu, and W. Chen · 2014
Later among the works it cites.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A data-based approach to social influence maximization
A. Goyal, F. Bonchi, and L. V. Lakshmanan · 2011
Cited alongside, same era.
Simpath: An efficient algorithm for influence maximization under the linear threshold model
A. Goyal, W. Lu, and L. V. Lakshmanan · 2011
Cited alongside, same era.
Learning diffusion probability based on node attributes in social networks
K. Saito, K. Ohara, Y. Yamagishi, M. Kimura, and H. Motoda · 2011
Cited alongside, same era.
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Y. Gai, B. Krishnamachari, and R. Jain · 2012
Cited alongside, same era.
Learning the graph of epidemic cascades
P. Netrapalli and S. Sanghavi · 2012
Cited alongside, same era.
W. Chen, Y. Wang, and Y. Yuan · 2014
Later among the works it cites.
Thompson sampling for complex online problems
A. Gopalan, S. Mannor, and Y. Mansour · 2014
Later among the works it cites.
Influence maximization: Near-optimal time complexity meets practical efficiency
Y. Tang, X. Xiao, and S. Yanchen · 2014
Later among the works it cites.
Online influence maximization
S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart · 2015
Closest in time.
Influence maximization in near-linear time: A martingale approach
Y. Tang, Y. Shi, and X. Xiao · 2015
Closest in time.