How to win elections

Abdallah Sobehy (1, 2, 3) , Walid Ben-Ameur (4, 1, 2, 3) , Hossam Afifi (5, 6, 1, 3) , Amira Bradai (6, 1, 3)

1 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
2 TSP - RS2M - Département Réseaux et Services Multimédia Mobiles
3 CNRS - Centre National de la Recherche Scientifique
4 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
5 R3S-SAMOVAR - Réseaux, Systèmes, Services, Sécurité
6 TSP - RST - Département Réseaux et Services de Télécommunications

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

Mots clés: Trust evaluation; Complex graphs; Opinion dynamics; Reputation systems; Trust management; Social networks; Random graphs; Mixed integer programming

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]

Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai. How to win elections. COLLABORATECOM 2016 : 12th International Conference on Collaborative Computing: Networking, Applications and Worksharing, Nov 2016, Beijing, China. pp.221 - 230, ⟨10.1007/978-3-319-59288-6_20⟩. ⟨hal-01710851⟩