ChoiceGAPs: Competitive diffusion as a massive multi-player game in social networks

Abstract

We consider the problem of modeling competitive diffusion in real world social networks via the notion of ChoiceGAPs which combine choice logic programs and Generalized Annotated Programs. We assume that each vertex in a social network is a player in a multi-player game (with a huge number of players) — the choice part of the ChoiceGAPs describes utilities of players for acting in various ways based on utilities of their neighbors in those and other situations. We define multi-player Nash equilibrium for such programs — but because they require some conditions that are hard to satisfy in the real world, we introduce the new model-theoretic concept of strong equilibrium. We show that strong equilibria can capture all Nash equilibria. We prove a host of complexity (intractability) results for checking existence of strong equilibria and identify a class of ChoiceGAPs for which strong equilibria can be polynomially computed. We perform experiments on a real-world Facebook data set surrounding the 2013 Italian election and show that our algorithms have good predictive accuracy with an Area Under a ROC Curve that, on average, is over 0.76.