Influence Maximization With Deactivation In Social Networks.

•An extension of the Influence Maximization Problem in social networks is considered.•A stochastic bilevel integer linear model is formulated to solve a Stackelberg game.•The leader of the game maximizes the total influence spread by activating nodes.•The follower minimizes the spread by deactivating some of the activated nodes.•Two matheuristic methods are developed for this stochastic optimization problem.