Election Manipulation on Social Networks with Messages on Multiple Candidates Extended Abstract

We study the problem of election control through social influence when the manipulator is allowed to use the locations that she acquired on the network for sending both positive and negative messages on multiple candidates, widely extending the previous results available in the literature that study the influence of a single message on a single candidate. In particular, we provide a tight characterization of the settings in which the maximum increase in the margin of victory can be efficiently approximated and of those in which any approximation turns out to be impossible.