Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust, 2010 IEEE International Conference on (2013)
Alexandria, VA, USA USA
Sept. 8, 2013 to Sept. 14, 2013
Influence blocking games have been used to model adversarial domains with a social component, such as counterinsurgency. In these games, a mitigator attempts to minimize the efforts of an influencer to spread his agenda across a social network. Previous work has assumed that the influence graph structure is known with certainty by both players. However, in reality, there is often significant information asymmetry between the mitigator and the influencer. We introduce a model of this information asymmetry as a two-player zero-sum Bayesian game. Nearly all past work in influence maximization and social network analysis suggests that graph structure is fundamental in strategy generation, leading to an expectation that solving the Bayesian game exactly is crucial. Surprisingly, we show through extensive experimentation on synthetic and real-world social networks that many common forms of uncertainty can be addressed near optimally by ignoring the vast majority of it and simply solving an abstracted game with a few randomly chosen types. This suggests that optimal strategies of games that do not model the full range of uncertainty in influence blocking games are typically robust to uncertainty about the influence graph structure.
Influence maximization, Game theory, Social contagion
J. Tsai, Y. Qian, Y. Vorobeychik, C. Kiekintveld and M. Tambe, "Bayesian Security Games for Controlling Contagion," 2013 International Conference on Social Computing (SocialCom)(SOCIALCOM), Alexandria, VA, USA, 2013, pp. 33-38.