Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hendrikx, F., Bubendorfer, K., Chard, R.: Reputation systems: a survey and taxonomy. J. Parallel Distrib. Comput. 75, 184–197 (2015)
Block Chain Principle. http://blockchain.info
Altman, E., Kumar, P., Venkatramanan, S., Kumar, A.: Competition over timeline in social networks. In: 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1352–1357. IEEE (2013)
Neglia, G., Ye, X., Gabielkov, M., Legout, A.: How to network in online social networks. In: 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 819–824. IEEE (2014)
Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17572-5_48
Chen, L., Leneutre, J.: Fight jamming with jamming-a game theoretic analysis of jamming attack in wireless networks and defense strategy. Comput. Netw. 55(9), 2259–2270 (2011)
Stackoverflow. http://stackoverflow.com/
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th International Conference on World Wide Web, pp. 640–651. ACM (2003)
Bradai, A., Ben-Ameur, W., Afifi, H.: Byzantine resistant reputation-based trust management. In: 2013 9th International Conference Conference on Collaborative Computing: Networking, Applications and Worksharing (Collaboratecom), pp. 269–278. IEEE (2013)
Twitter. http://twitter.com
Facebook. http://www.facebook.com
Chen, K., Liu, G., Shen, H., Qi, F.: Sociallink: utilizing social network and transaction links for effective trust management in P2P file sharing systems. In: 2015 IEEE International Conference on Peer-to-Peer Computing (P2P), pp. 1–10. IEEE (2015)
DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118–121 (1974)
Krause, U.: A discrete nonlinear and non-autonomous model of consensus formation. In: Communications in Difference Equations, pp. 227–236 (2000)
Acemoglu, D., Ozdaglar, A.: Opinion dynamics and learning in social networks. Dyn. Games Appl. 1(1), 3–49 (2011)
Ben-Ameur, W., Bianchi, P., Jakubowicz, J.: Robust distributed consensus using total variation. IEEE Trans. Autom. Control 61(6), 1550–1564 (2016)
Ben-Ameur, W., Bianchi, P., Jakubowicz, J.: Robust average consensus using total variation gossip algorithm. In: 2012 6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS), pp. 99–106. IEEE (2012)
Erdos, P., Renyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290–297 (1959)
Penrose, M.: Random Geometric Graphs (No. 5). Oxford University Press (2003)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Gurobi optimizer reference manual. http://www.gurobi.com
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sobehy, A., Ben-Ameur, W., Afifi, H., Bradai, A. (2017). How to Win Elections. In: Wang, S., Zhou, A. (eds) Collaborate Computing: Networking, Applications and Worksharing. CollaborateCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 201. Springer, Cham. https://doi.org/10.1007/978-3-319-59288-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-59288-6_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59287-9
Online ISBN: 978-3-319-59288-6
eBook Packages: Computer ScienceComputer Science (R0)