TY - JOUR
T1 - Opinion diffusion and campaigning on society graphs
AU - Faliszewski, Piotr
AU - Gonen, Rica
AU - Koutecý, Martin
AU - Talmon, Nimrod
N1 - Funding Information:
Piotr Faliszewski was partially supported by the funds of Polish Ministry of Science and Higher Education assigned to the AGH University of Science and Technology. During its final stages, this project has received funding from the European Research Council under the European Union’s Horizon 2020 research and innovation programme (101002854). Martin Koutecký was partially supported by the Charles University project UNCE/SCI/004 and by the project 19-27871X of GA Cˇ R. Nimrod Talmon was supported by the Israel Science Foundation (630/19). We are very grateful to the IJCAI reviewers for their useful feedback on the early version of this paper.
Publisher Copyright:
© The Author(s) 2022. Published by Oxford University Press. All rights reserved.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network connecting the clusters. Our model can incorporate different campaigning actions, various partitions of the society into clusters and very general diffusion processes. Perhaps surprisingly, we show that computing the cheapest campaign for rigging a given election can usually be done efficiently, even with arbitrarily-many voters. Moreover, we report on computational simulations we have performed to evaluate the quality and efficiency of finding such solutions.
AB - We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network connecting the clusters. Our model can incorporate different campaigning actions, various partitions of the society into clusters and very general diffusion processes. Perhaps surprisingly, we show that computing the cheapest campaign for rigging a given election can usually be done efficiently, even with arbitrarily-many voters. Moreover, we report on computational simulations we have performed to evaluate the quality and efficiency of finding such solutions.
UR - http://www.scopus.com/inward/record.url?scp=85140791292&partnerID=8YFLogxK
U2 - 10.1093/logcom/exac014
DO - 10.1093/logcom/exac014
M3 - Article
AN - SCOPUS:85140791292
SN - 0955-792X
VL - 32
SP - 1162
EP - 1194
JO - Journal of Logic and Computation
JF - Journal of Logic and Computation
IS - 6
ER -