How to Win Elections

Consider an election with two competing candidates and a set of voters whose opinions change over time. We study the best strategies that can be used by each candidate to influence voters. We also evaluate the knowledge advantage when one of the candidates knows in advance the adversary’s strategy. We prove that an economy of up to 50% of the budget can be saved in such a scenario.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[3]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[4]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[5]  M. Degroot.  Reaching a Consensus , 1974 .

[6]  Pascal Bianchi,et al.  Robust average consensus using Total Variation Gossip Algorithm , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[7]  Eitan Altman,et al.  Competition over timeline in social networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[8]  Lin Chen,et al.  Fight jamming with jamming - A game theoretic analysis of jamming attack in wireless networks and defense strategy , 2011, Comput. Networks.

[9]  Pascal Bianchi,et al.  Robust Distributed Consensus Using Total Variation , 2016, IEEE Transactions on Automatic Control.

[10]  Arnaud Legout,et al.  How to network in online social networks , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[11]  Kang Chen,et al.  Sociallink: utilizing social network and transaction links for effective trust management in P2P file sharing systems , 2015, 2015 IEEE International Conference on Peer-to-Peer Computing (P2P).

[12]  Hossam Afifi,et al.  Byzantine resistant reputation-based trust management , 2013, 9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[13]  U. Krause.  A DISCRETE NONLINEAR AND NON–AUTONOMOUS MODEL OF CONSENSUS FORMATION , 2007 .

[14]  Asuman E. Ozdaglar,et al.  Opinion Dynamics and Learning in Social Networks , 2010, Dyn. Games Appl..

[15]  Kris Bubendorfer,et al.  Reputation systems: A survey and taxonomy , 2015, J. Parallel Distributed Comput..