@article {1436,
	title = {Minimizing the misinformation spread in social networks},
	journal = {IISE Transactions},
	volume = {52},
	year = {2020},
	pages = {850-863},
	abstract = {<p>AbstractThe Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player{\textquoteright}s problem. In both of them, the second player{\textquoteright}s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.</p>},
	doi = {10.1080/24725854.2019.1680909},
	url = {https://doi.org/10.1080/24725854.2019.1680909},
	author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel and Evren G{\"u}ney}
}
