# Influence Maximization with Bandits

27 Feb 2015Sharan VaswaniLaks. V. S. LakshmananMark Schmidt

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. Most prior work on this topic assumes that we know the probability of each user influencing each other user, or we have data that lets us estimate these influences... (read more)

PDF Abstract

No code implementations yet. Submit your code now