{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T22:28:25Z","timestamp":1786660105995,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032228192","type":"print"},{"value":"9783032228208","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22820-8_10","type":"book-chapter","created":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T22:04:12Z","timestamp":1786658652000},"page":"161-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Controlling the\u00a0Spread of\u00a0Two Secrets in\u00a0Diverse Social Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9165-6280","authenticated-orcid":false,"given":"V\u00e1clav","family":"Bla\u017eej","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-5709","authenticated-orcid":false,"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8901-1942","authenticated-orcid":false,"given":"\u0160imon","family":"Schierreich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1613\/jair.1.11509","volume":"69","author":"M Amoruso","year":"2020","unstructured":"Amoruso, M., Anello, D., Auletta, V., Cerulli, R., Ferraioli, D., Raiconi, A.: Contrasting the spread of misinformation in online social networks. J. Artif. Intell. Res. 69, 847\u2013879 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9780511804090","DOI":"10.1017\/CBO9780511804090"},{"key":"10_CR3","unstructured":"Auxier, B., Anderson, M.: Social media use in 2021. Technical report, Pew (2021)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barrot, N., Lang, J., Yokoo, M.: Manipulation of hamming-based approval voting for multiple referenda and committee elections. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS\u00a0\u201917, pp. 597\u2013605 (2017)","DOI":"10.65109\/MAPF7770"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Becker, R., Cor\u00f2, F., D\u2019Angelo, G., Gilbert, H.: Balancing spreads of influence in a social network. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201920, pp. 3\u201310 (2020)","DOI":"10.1609\/aaai.v34i01.5327"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Bredereck, R., Knop, D., Luo, J.: Fine-grained view on bribery for group identification. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201920, pp. 67\u201373 (2020)","DOI":"10.24963\/ijcai.2020\/10"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Elkind, E.: Manipulating opinion diffusion in social networks. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201917, pp. 894\u2013900 (2017)","DOI":"10.24963\/ijcai.2017\/124"},{"key":"10_CR8","unstructured":"Butcher, P.: Disinformation and democracy: the home front in the information war. Technical report, European Policy Centre (2019)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1038\/s41928-020-00532-2","volume":"4","author":"P Butcher","year":"2021","unstructured":"Butcher, P.: COVID-19 as a turning point in the fight against disinformation. Nat. Electron. 4(1), 7\u20139 (2021)","journal-title":"Nat. Electron."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Ferraioli, D., Gatti, N.: Election control in social networks via edge addition or removal. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201920, pp. 1878\u20131885 (2020)","DOI":"10.1609\/aaai.v34i02.5556"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.3982\/TE2156","volume":"12","author":"WJ Cho","year":"2017","unstructured":"Cho, W.J., Ju, B.G.: Multinary group identification. Theor. Econ. 12(2), 513\u2013531 (2017)","journal-title":"Theor. Econ."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theoret. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"16598","DOI":"10.1038\/s41598-020-73510-5","volume":"10","author":"M Cinelli","year":"2020","unstructured":"Cinelli, M., et al.: The COVID-19 social media infodemic. Sci. Rep. 10(1), 16598 (2020)","journal-title":"Sci. Rep."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Eiben, E., Ganian, R., Hamm, T., Ordyniak, S.: The complexity of envy-free graph cutting. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201922, pp. 237\u2013243 (2022)","DOI":"10.24963\/ijcai.2022\/34"},{"key":"10_CR16","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 5th edn. Springer, Heidelberg (2017)","edition":"5"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Dun, Y., Tu, K., Chen, C., Hou, C., Yuan, X.: KAN: knowledge-aware attention network for fake news detection. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201921, pp. 81\u201389 (2021)","DOI":"10.1609\/aaai.v35i1.16080"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, M., Knop, D., Schierreich, \u0160.: On the complexity of target set selection in simple geometric networks. Discret. Math. Theoret. Comput. Sci. 26(2), 11:1\u201326 (2024)","DOI":"10.46298\/dmtcs.11591"},{"key":"10_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103561","volume":"300","author":"P Dvo\u0159\u00e1k","year":"2021","unstructured":"Dvo\u0159\u00e1k, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 300, 103561 (2021)","journal-title":"Artif. Intell."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. Autonom. Agents Multi-Agent Syst. 34(8) (2020)","DOI":"10.1007\/s10458-019-09427-9"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Slinko, A., Talmon, N.: Multiwinner rules with variable number of winners. In: Proceedings of the 24th European Conference on Artificial Intelligence, ECAI\u00a0\u201920, pp. 67\u201374 (2020)","DOI":"10.3233\/FAIA200077"},{"key":"10_CR22","unstructured":"Garimella, K., Gionis, A., Parotsidis, N., Tatti, N.: Balancing information exposure in social networks. In: Proceedings of the 31st Conference on Neural Information Processing Systems, NIPS\u00a0\u201917, pp. 4663\u20134671 (2017)"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Giansiracusa, N.: How Algorithms Create and Prevent Fake News. Apress, Berkeley, CA (2021). https:\/\/doi.org\/10.1007\/978-1-4842-7155-1","DOI":"10.1007\/978-1-4842-7155-1"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Godziszewski, M.T., Batko, P., Skowron, P., Faliszewski, P.: An analysis of approval-based committee rules for 2d-Euclidean elections. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201921, pp. 5448\u20135455 (2021)","DOI":"10.1609\/aaai.v35i6.16686"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Guess, A., Nagler, J., Tucker, J.: Less than you think: prevalence and predictors of fake news dissemination on Facebook. Sci. Adv. 5(1) (2019)","DOI":"10.1126\/sciadv.aau4586"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the Complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Jin, Y., et al.: Towards fine-grained reasoning for fake news detection. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201922, pp. 5746\u20135754 (2022)","DOI":"10.1609\/aaai.v36i5.20517"},{"key":"10_CR28","unstructured":"Kasher, A., Rubinstein, A.: On the question \u201cWho is a J?\u201d a social choice approach. Logique et Analyse 40(160), 385\u2013395 (1997)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP\u00a0\u201905, pp. 1127\u20131138 (2005)","DOI":"10.1007\/11523468_91"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Knop, D., Schierreich, \u0160., Such\u00fd, O.: Balancing the spread of two opinions in sparse social networks (student abstract). In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201922, pp. 12987\u201312988 (2022)","DOI":"10.1609\/aaai.v36i11.21630"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Lackner, M., Skowron, P.: Multi-winner Voting with Approval Preferences. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-09016-5"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Laslier, J.F., Sanver, M.R.: Handbook on Approval Voting. Springer, New York (2009)","DOI":"10.1007\/978-3-642-02839-7"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Lazer, D.M.J., et al.: The science of fake news 359(6380), 1094\u20131096 (2018)","DOI":"10.1126\/science.aao2998"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Loos, E., Nijenhuis, J.: Consuming fake news: a matter of age? The perception of political fake news stories in Facebook ads. In: Proceedings of the 6th International Conference on Human Aspects of IT for the Aged Population, ITAP\u00a0\u201920, pp. 69\u201388 (2020)","DOI":"10.1007\/978-3-030-50232-4_6"},{"issue":"2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Marx, D., Sidiropoulos, A.: The limited blessing of low dimensionality: when 1-1\/d is the best possible exponent for d-dimensional geometric problems. In: Proceedings of the 30th Annual Symposium on Computational Geometry, SOCG\u00a0\u201914, pp. 67\u201376 (2014)","DOI":"10.1145\/2582112.2582124"},{"key":"10_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.035101","volume":"66","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66, 035101 (2002)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"10_CR38","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Przybyla, P.: Capturing the style of fake news. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI\u00a0\u201920, pp. 490\u2013497 (2020)","DOI":"10.1609\/aaai.v34i01.5386"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Qian, F., Gong, C., Sharma, K., Liu, Y.: Neural user response generator: fake news detection with collective user intelligence. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201918, pp. 3834\u20133840 (2018)","DOI":"10.24963\/ijcai.2018\/533"},{"issue":"1","key":"10_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10584609.2021.1910887","volume":"39","author":"SC Rhodes","year":"2022","unstructured":"Rhodes, S.C.: Filter bubbles, echo chambers, and fake news. Polit. Commun. 39(1), 1\u201322 (2022)","journal-title":"Polit. Commun."},{"key":"10_CR42","unstructured":"Sanders, L.: Trust in media 2022: Where Americans get their news and who they trust for information. Technical report, YouGov.com (2022)"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Sina, S., Hazon, N., Hassidim, A., Kraus, S.: Adapting the social network to affect elections. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS\u00a0\u201915, pp. 705\u2013713 (2015)","DOI":"10.65109\/IIZZ5199"},{"key":"10_CR44","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.copsyc.2020.03.014","volume":"36","author":"C Sindermann","year":"2020","unstructured":"Sindermann, C., Cooper, A., Montag, C.: A short review on susceptibility to falling for fake political news. Curr. Opin. Psychol. 36, 44\u201348 (2020)","journal-title":"Curr. Opin. Psychol."},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Soetekouw, L., Angelopoulos, S.: Digital resilience through training protocols: learning to identify fake news on social media. Inf. Syst. Front. (2022)","DOI":"10.1007\/s10796-021-10240-7"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Yang, Y.: Complexity of manipulating and controlling approval-based multiwinner voting. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201919, pp. 637\u2013643 (2019)","DOI":"10.24963\/ijcai.2019\/90"},{"issue":"5","key":"10_CR47","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s10458-018-9392-1","volume":"32","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Dimitrov, D.: How hard is it to control a group? Auton. Agent. Multi-Agent Syst. 32(5), 672\u2013692 (2018). https:\/\/doi.org\/10.1007\/s10458-018-9392-1","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Yang, Y., Wang, J.: Multiwinner voting with restricted admissible sets: complexity and strategyproofness. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI\u00a0\u201918, pp. 576\u2013582 (2018)","DOI":"10.24963\/ijcai.2018\/80"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22820-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T22:04:15Z","timestamp":1786658655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22820-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032228192","9783032228208"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22820-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/euramas.github.io\/eumas2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}