Skip to main content
Springer Nature Link
Log in

Election control through social influence with voters’ uncertainty

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The problem of election control through social influence consists in finding a set of nodes in a social network of voters to be the starters of a political campaign aimed at supporting a particular target candidate. The voters reached by the campaign change their views on the candidates. The goal is to model the spread of the campaign in such a way as to maximize the chances of winning for the target candidate. Herein, differently from previous work, we consider that each voter is associated with a probability distribution over the candidates modeling the likelihood of the voter to vote for each candidate. In a first model we propose, we prove that, under the Gap-ETH, the problem cannot be approximated to within a factor better than \(1/n^{o(1)}\), where n is the number of voters. In a second model, which is a slight relaxation of the first one, the problem instead admits a constant-factor approximation algorithm. Finally, we present simulations on both synthetic and real networks, comparing the results of our algorithm with those obtained by a standard greedy algorithm for Influence Maximization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

Enquiries about data availability should be directed to the authors.

Notes

  1. https://en.wikipedia.org/wiki/Facebook-Cambridge_Analytica_data_scandal (page retrieved on 08/07/2021).

  2. The assumption is used in the approximation results, since Influence Maximization problem with exponential (or exponentially small) weights on nodes is an open problem (Kempe et al. 2015, footnote 3, page 119). However, the assumption is realistic: Current techniques to estimate such parameters generate values linear in the number of messages shared by a node.

  3. It is still an open question how well the value of \(\sigma _w(S)\) can be approximated for an influence model with arbitrary node weights [Kempe et al. (2015), footnote 3, page 119].

References

  • Abouei Mehrizi M, Corò F, Cruciani E, D’Angelo G (2020) Election control through social influence with unknown preferences. In Computing and Combinatorics - 26th International Conference, COCOON 2020, pp 397–410. https://doi.org/10.1007/978-3-030-58150-3_32

  • Abouei Mehrizi M, D’Angelo G (2020) Multi-winner election control via social influence. In Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, pp 331–348. https://doi.org/10.1007/978-3-030-54921-3_19

  • Abouei Mehrizi M, D’Angelo G (2020) Multi-winner election control via social influence: hardness and algorithms for restricted cases. Algorithms 13(10):251. https://doi.org/10.3390/a13100251

    Article  MathSciNet  Google Scholar 

  • Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election. J Econ Perspect 31(2):211–36

    Article  Google Scholar 

  • Apt KR, Markakis E (2014) Social networks with competing products. Fundam Inform 129(3):225–250. https://doi.org/10.3233/FI-2014-970

    Article  MathSciNet  MATH  Google Scholar 

  • Auletta V, Ferraioli D, Savarese V (2020) Manipulating an election in social networks through link addition. J Ambient Intell Humaniz Comput 11(10):4073–4088. https://doi.org/10.1007/s12652-019-01669-5

    Article  Google Scholar 

  • Bond RM, Fariss CJ, Jones JJ, Kramer ADI, Marlow C, Settle JE, Fowler JH (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489(7415):295–298. https://doi.org/10.1038/nature11421

    Article  Google Scholar 

  • Bredereck R, Elkind E (2017) Manipulating opinion diffusion in social networks. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp 894–900 . https://doi.org/10.24963/ijcai.2017/124

  • Castiglioni M, Gatti N, Landriani G, Ferraioli D (2019) Election manipulation on social networks: Seeding, edge removal, edge addition. arXiv pp. arXiv–1911

  • Conover M, Ratkiewicz J, Francisco M, Gonçalves B, Menczer F, Flammini A (2011) Political polarization on twitter. In: AAAI

  • Corò F, Cruciani E, D’Angelo G, Ponziani S (2019) Exploiting social influence to control elections based on scoring rules. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp 201–207. https://doi.org/10.24963/ijcai.2019/29

  • Corò F, Cruciani E, D’Angelo G, Ponziani S (2019) Vote for me!: Election control via social influence in arbitrary scoring rule voting systems. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’19, Montreal, QC, Canada, May 13-17, 2019, pp 1895–1897. http://dl.acm.org/citation.cfm?id=3331955

  • Faliszewski P, Gonen R, Koutecký M, Talmon N (2018) Opinion diffusion and campaigning on society graphs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, pp 219–225. https://doi.org/10.24963/ijcai.2018/30

  • Faliszewski P, Rothe J (2016) Control and bribery in voting. In: Handbook of computational social choice, pp 146–168 . https://doi.org/10.1017/CBO9781107446984.008

  • Ferrara E (2017) Disinformation and social bot operations in the run up to the 2017 french presidential election. First Monday, vol 22(8) . https://firstmonday.org/ojs/index.php/fm/article/view/8005

  • Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. In: Davison BD, Suel T, Craswell N, Liu B (eds) Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, New York, NY, USA, February 4-6, 2010, ACM, pp 241–250. https://doi.org/10.1145/1718487.1718518

  • Goyal A, Lu W, Lakshmanan LVS (2011) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: Cook DJ, Pei J, Wang W, Zaïane OR, Wu X (eds) 11th IEEE International Conference on Data Mining, ICDM 2011, Vancouver, BC, Canada, December 11-14, 2011. IEEE Computer Society, pp 211–220. https://doi.org/10.1109/ICDM.2011.132

  • Kempe D, Kleinberg JM, Tardos É (2015) Maximizing the spread of influence through a social network. Theory Comput. 11:105–147. https://doi.org/10.4086/toc.2015.v011a004

    Article  MathSciNet  MATH  Google Scholar 

  • Kreiss D (2016) Seizing the moment: the presidential campaigns’ use of twitter during the 2012 electoral cycle. New Media Soc 18(8):1473–1490. https://doi.org/10.1177/1461444814562445

    Article  Google Scholar 

  • Li Y, Fan J, Wang Y, Tan K (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852–1872. https://doi.org/10.1109/TKDE.2018.2807843

    Article  Google Scholar 

  • Manurangsi P (2017) Almost-polynomial ratio eth-hardness of approximating densest k-subgraph. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pp 954–961 . https://doi.org/10.1145/3055399.3055412

  • Matsa KE, Shearer E (2018) News use across social media platforms 2018. Pew Research Center . http://www.journalism.org/2018/09/10/news-use-across-social-media-platforms-2018/. Accessed Feb, 9th, 2019

  • Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions–I. Math Program 14(1):265–294. https://doi.org/10.1007/BF01588971

    Article  MathSciNet  MATH  Google Scholar 

  • Raghavendra P, Steurer D (2010) Graph expansion and the unique games conjecture. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp 755–764 . https://doi.org/10.1145/1806689.1806792

  • Rahimkhani K, AleAhmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42(3):1353–1361. https://doi.org/10.1016/j.eswa.2014.09.037

    Article  Google Scholar 

  • Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI . http://networkrepository.com

  • Stier S, Bleier A, Lietz H, Strohmaier M (2018) Election campaigning on social media: politicians, audiences, and the mediation of political communication on facebook and twitter. Political Commun 35(1):50–74. https://doi.org/10.1080/10584609.2017.1334728

    Article  Google Scholar 

  • Wilder B, Vorobeychik Y (2018) Controlling elections through social influence. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, pp 265–273 . http://dl.acm.org/citation.cfm?id=3237428

  • Wilder B, Vorobeychik Y (2019) Defending elections against malicious spread of misinformation. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, AAAI Press, pp 2213–2220. https://doi.org/10.1609/aaai.v33i01.33012213

Download references

Funding

The authors have not disclosed any funding.

Author information

Authors and Affiliations

  1. Gran Sasso Science Institute, L’Aquila, Italy

    Mohammad Abouei Mehrizi

  2. Missouri University of Science and Technology, Rolla, USA

    Federico Corò

  3. Paris-Lodron-Universität Salzburg, Salzburg, Austria

    Emilio Cruciani

  4. Gran Sasso Science Institute, L’Aquila, Italy

    Gianlorenzo D’Angelo

Authors
  1. Mohammad Abouei Mehrizi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Federico Corò
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Emilio Cruciani
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Gianlorenzo D’Angelo
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Federico Corò.

Ethics declarations

Competing interests

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abouei Mehrizi, M., Corò, F., Cruciani, E. et al. Election control through social influence with voters’ uncertainty. J Comb Optim 44, 635–669 (2022). https://doi.org/10.1007/s10878-022-00852-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-022-00852-3

Keywords