Abstract
Most research on influence maximization considers asimple diffusion model, in which binary information is being diffused (i.e., vertices – corresponding to agents – are either active or passive). Here we consider a more involved model of opinion diffusion: In our model, each vertex in the network has either approval-based or ordinal-based preferences and we consider diffusion processes in which each vertex is influenced by its neighborhood following a local election, according to certain “local” voting rules. We are interested in externally changing the preferences of certain vertices (i.e., campaigning) in order to influence the resulting election, whose winner is decided according to some “global” voting rule, operating after the diffusion converges. As the corresponding combinatorial problem is computationally intractable in general, and as we wish to incorporate probabilistic diffusion processes, we consider classic heuristics adapted to our setting: A greedy heuristic and a local search heuristic. We study their properties for plurality elections, approval elections, and ordinal elections, and evaluate their quality experimentally. The bottom line of our experiments is that the heuristics we propose perform reasonably well on both the real world and synthetic instances. Moreover, examining our results in detail also shows how the different parameters (ballot type, bribery type, graph structure, number of voters and candidates, etc.) influence the run time and quality of solutions. This knowledge can guide further research and applications.
Partially supported by Ministry of Science, Technology and Space Binational Israel-Taiwan grant, number 3-16542.
Partially supported by Charles University project UNCE/SCI/004 and by the project 22-22997S of GA ČR. Computational resources were supplied by the project “e-Infrastruktura CZ" (e-INFRA CZ LM2018140) supported by the Ministry of Education, Youth and Sports of the Czech Republic, and by the ELIXIR-CZ project (LM2018131), part of the international ELIXIR infrastructure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
For simplicity, we assume bribery operations always succeed. A relaxation of this assumption is left for future work.
- 2.
To avoid division by zero, we define the Borda score of a candidate ranked as jth to be \(|A|-j+1\) instead of \(|A|-j\), although the latter is more common. These definitions are mathematically equivalent.
- 3.
References
Allcott, H., Gentzkow, M.: Social media and fake news in the 2016 election. J. Econ. Perspectives 31(2), 211–36 (2017)
Brandt, F., Conitzer, V., Endriss, U., Lang, J.: P rocaccia. Handbook of computational social choice. Cambridge University Press, A.D. (2016)
Bredereck, R., Elkind, E.: Manipulating opinion diffusion in social networks. In: Proceedings of IJCAI 2017 (2017)
Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400–1415 (2009). https://doi.org/10.1137/08073617X, https://doi.org/10.1137/08073617X
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208 (2009)
Coro, F., Cruciani, E., D’Angelo, G., Ponziani, S.: Exploiting social influence to control elections based on scoring rules. In: Proceedings of IJCAI 2019 (2019)
Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Proceedings of WINE 2010, pp. 473–482 (2010)
Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299–310. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04645-2_27
Ellison, N.B., Lampe, C., Steinfield, C.: Social network sites and society: current trends and future possibilities. Interactions 16(1), 6 (2009)
Endriss, U.: Trends in Computational Social Choice. AI Access (2017)
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485–532 (2009)
Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 7. Cambridge University Press (2015)
Faliszewski, P., Gonen, R., Kouteckỳ, M., Talmon, N.: Opinion diffusion and campaigning on society graphs. In: Proceedings of IJCAI 2018, pp. 219–225 (2018)
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485–532 (2009)
Faliszewski, P., Skowron, P., Talmon, N.: Bribery as a measure of candidate success: complexity results for approval-based multiwinner rules. In: Proceedings of AAMAS 2017, pp. 6–14 (2017)
Gonen, R., Koutecky, M., Menashof, R., Talmon, N.: Heuristics for opinion diffusion via local elections full version (2022). https://www.openu.ac.il/personal_sites/rica-gonen/
Grandi, U., Lorini, E., Perrussel, L.: Propositional opinion diffusion. In: Proceedings of AAMAS 2015, pp. 989–997 (2015)
Guille, A., Hacid, H., Favre, C., Zighed, D.A.: Information diffusion in online social networks: a survey. ACM SIGMOD Rec. 42(2), 17–28 (2013)
Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated annealing based influence maximization in social networks. In: Proceedings of AAAI 2011. vol. 11, pp. 127–132 (2011)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of KDD 2003, pp. 137–146 (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429 (2007)
Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., Guo, R.: Diffusion in Social Networks. Springer (2015)
Wang, J., Su, W., Yang, M., Guo, J., Feng, Q., Shi, F., Chen, J.: Parameterized complexity of control and bribery for \(d\)-approval elections. Theoret. Comput. Sci. 595, 82–91 (2015)
Wilder, B., Vorobeychik, Y.: Controlling elections through social influence. In: Proceedings of AAMAS 2018, pp. 265–273 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gonen, R., Koutecký, M., Menashof, R., Talmon, N. (2023). Heuristics for Opinion Diffusion via Local Elections. In: Gąsieniec, L. (eds) SOFSEM 2023: Theory and Practice of Computer Science. SOFSEM 2023. Lecture Notes in Computer Science, vol 13878. Springer, Cham. https://doi.org/10.1007/978-3-031-23101-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-23101-8_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-23100-1
Online ISBN: 978-3-031-23101-8
eBook Packages: Computer ScienceComputer Science (R0)