{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:21:18Z","timestamp":1742995278917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_10","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"144-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristics for\u00a0Opinion Diffusion via\u00a0Local Elections"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8836-6140","authenticated-orcid":false,"given":"Rica","family":"Gonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-0053","authenticated-orcid":false,"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8733-991X","authenticated-orcid":false,"given":"Roei","family":"Menashof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7916-0979","authenticated-orcid":false,"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1257\/jep.31.2.211","volume":"31","author":"H Allcott","year":"2017","unstructured":"Allcott, H., Gentzkow, M.: Social media and fake news in the 2016 election. J. Econ. Perspectives 31(2), 211\u201336 (2017)","journal-title":"J. Econ. Perspectives"},{"key":"10_CR2","volume-title":"P rocaccia","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J.: P rocaccia. Handbook of computational social choice. Cambridge University Press, A.D. (2016)"},{"doi-asserted-by":"crossref","unstructured":"Bredereck, R., Elkind, E.: Manipulating opinion diffusion in social networks. In: Proceedings of IJCAI 2017 (2017)","key":"10_CR3","DOI":"10.24963\/ijcai.2017\/124"},{"doi-asserted-by":"publisher","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009). https:\/\/doi.org\/10.1137\/08073617X, https:\/\/doi.org\/10.1137\/08073617X","key":"10_CR4","DOI":"10.1137\/08073617X"},{"doi-asserted-by":"crossref","unstructured":"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\u2013208 (2009)","key":"10_CR5","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"crossref","unstructured":"Coro, F., Cruciani, E., D\u2019Angelo, G., Ponziani, S.: Exploiting social influence to control elections based on scoring rules. In: Proceedings of IJCAI 2019 (2019)","key":"10_CR6","DOI":"10.24963\/ijcai.2019\/29"},{"doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Proceedings of WINE 2010, pp. 473\u2013482 (2010)","key":"10_CR7","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04645-2_27"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1456202.1456204","volume":"16","author":"NB Ellison","year":"2009","unstructured":"Ellison, N.B., Lampe, C., Steinfield, C.: Social network sites and society: current trends and future possibilities. Interactions 16(1), 6 (2009)","journal-title":"Interactions"},{"unstructured":"Endriss, U.: Trends in Computational Social Choice. AI Access (2017)","key":"10_CR10"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"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)","key":"10_CR12"},{"doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Gonen, R., Kouteck\u1ef3, M., Talmon, N.: Opinion diffusion and campaigning on society graphs. In: Proceedings of IJCAI 2018, pp. 219\u2013225 (2018)","key":"10_CR13","DOI":"10.24963\/ijcai.2018\/30"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"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\u201314 (2017)","key":"10_CR15"},{"doi-asserted-by":"crossref","unstructured":"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\/","key":"10_CR16","DOI":"10.1007\/978-3-031-23101-8_10"},{"unstructured":"Grandi, U., Lorini, E., Perrussel, L.: Propositional opinion diffusion. In: Proceedings of AAMAS 2015, pp. 989\u2013997 (2015)","key":"10_CR17"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille, A., Hacid, H., Favre, C., Zighed, D.A.: Information diffusion in online social networks: a survey. ACM SIGMOD Rec. 42(2), 17\u201328 (2013)","journal-title":"ACM SIGMOD Rec."},{"doi-asserted-by":"crossref","unstructured":"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\u2013132 (2011)","key":"10_CR19","DOI":"10.1609\/aaai.v25i1.7838"},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of KDD 2003, pp. 137\u2013146 (2003)","key":"10_CR20","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"crossref","unstructured":"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\u2013429 (2007)","key":"10_CR21","DOI":"10.1145\/1281192.1281239"},{"doi-asserted-by":"crossref","unstructured":"Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., Guo, R.: Diffusion in Social Networks. Springer (2015)","key":"10_CR22","DOI":"10.1007\/978-3-319-23105-1"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2015.06.016","volume":"595","author":"J Wang","year":"2015","unstructured":"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\u201391 (2015)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Wilder, B., Vorobeychik, Y.: Controlling elections through social influence. In: Proceedings of AAMAS 2018, pp. 265\u2013273 (2018)","key":"10_CR24"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:36Z","timestamp":1673049936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3+","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}