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.
|Number of pages||33|
|Journal||Journal of Logic and Computation|
|State||Published - 2022|
Bibliographical noteFunding 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.
© The Author(s) 2022. Published by Oxford University Press. All rights reserved.
DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.