Next Article in Journal
Multi-objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem
Next Article in Special Issue
On Multidimensional Congestion Games
Previous Article in Journal
A Clustering Routing Algorithm Based on Improved Ant Colony Optimization Algorithms for Underwater Wireless Sensor Networks
Previous Article in Special Issue
Graph Planarity by Replacing Cliques with Paths
Open AccessArticle

Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases

Computer Science Department, Gran Sasso Science Institute (GSSI), Viale Francesco Crispi, 67100 L’Aquila AQ, Italy
*
Authors to whom correspondence should be addressed.
Algorithms 2020, 13(10), 251; https://doi.org/10.3390/a13100251
Received: 4 September 2020 / Revised: 28 September 2020 / Accepted: 29 September 2020 / Published: 2 October 2020
(This article belongs to the Special Issue Graph Algorithms and Applications)
Nowadays, many political campaigns are using social influence in order to convince voters to support/oppose a specific candidate/party. In election control via social influence problem, an attacker tries to find a set of limited influencers to start disseminating a political message in a social network of voters. A voter will change his opinion when he receives and accepts the message. In constructive case, the goal is to maximize the number of votes/winners of a target candidate/party, while in destructive case, the attacker tries to minimize them. Recent works considered the problem in different models and presented some hardness and approximation results. In this work, we consider multi-winner election control through social influence on different graph structures and diffusion models, and our goal is to maximize/minimize the number of winners in our target party. We show that the problem is hard to approximate when voters’ connections form a graph, and the diffusion model is the linear threshold model. We also prove the same result considering an arborescence under independent cascade model. Moreover, we present a dynamic programming algorithm for the cases that the voting system is a variation of straight-party voting, and voters form a tree. View Full-Text
Keywords: computational social choice; election control; multi-winner election; social influence; influence maximization computational social choice; election control; multi-winner election; social influence; influence maximization
MDPI and ACS Style

Abouei Mehrizi, M.; D'Angelo, G. Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases. Algorithms 2020, 13, 251.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop