{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T18:05:11Z","timestamp":1744653911847,"version":"3.37.3"},"reference-count":62,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Polish Ministry of Science and Higher Education"},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["101002854"],"award-info":[{"award-number":["101002854"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007397","name":"Charles University","doi-asserted-by":"publisher","award":["UNCE\/SCI\/004"],"award-info":[{"award-number":["UNCE\/SCI\/004"]}],"id":[{"id":"10.13039\/100007397","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"GA \u010cR","doi-asserted-by":"publisher","award":["19-27871X"],"award-info":[{"award-number":["19-27871X"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["630\/19"],"award-info":[{"award-number":["630\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>","DOI":"10.1093\/logcom\/exac014","type":"journal-article","created":{"date-parts":[[2022,2,5]],"date-time":"2022-02-05T04:33:48Z","timestamp":1644035628000},"page":"1162-1194","source":"Crossref","is-referenced-by-count":4,"title":["Opinion diffusion and campaigning on society graphs"],"prefix":"10.1093","volume":"32","author":[{"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[{"name":"Instytut Informatyki, AGH University of Science and Technology , 30-059 Krak\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rica","family":"Gonen","sequence":"additional","affiliation":[{"name":"Department of Management and Economics, The Open University of Israel , The University Road 1. Raanana, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[{"name":"Computer Science Institute, Faculty of Mathematics and Physics, Charles University , Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev , David Ben Gurion Blvd 1. Be'er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"key":"2022122207401830400_ref1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1257\/jep.31.2.211","article-title":"Social media and fake news in the 2016 election","volume":"31","author":"Allcott","year":"2017","journal-title":"Journal of Economic Perspectives"},{"key":"2022122207401830400_ref2","first-page":"74","article-title":"Minority becomes majority in social networks","volume-title":"Proceedings of WINE \u201815","author":"Auletta","year":"2015"},{"key":"2022122207401830400_ref3","first-page":"49","article-title":"Reasoning about consensus when opinions diffuse through majority dynamics","volume-title":"Proceedings of IJCAI \u201818","author":"Auletta","year":"2018"},{"key":"2022122207401830400_ref4","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1016\/j.artint.2020.103288","article-title":"On the complexity of reasoning about opinion diffusion under majority dynamics","volume":"284","author":"Auletta","year":"2020","journal-title":"Artificial Intelligence"},{"volume-title":"AIMMS Optimization Modeling","year":"2006","author":"Bisschop","key":"2022122207401830400_ref5"},{"key":"2022122207401830400_ref6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1111\/jopp.12065","article-title":"Liquid democracy: Potentials, problems, and perspectives","volume":"24","author":"Blum","year":"2016","journal-title":"Journal of Political Philosophy"},{"key":"2022122207401830400_ref7","first-page":"828","article-title":"Multi-issue opinion diffusion under constraints","volume-title":"Proceedings of AAMAS \u201819","author":"Botan","year":"2019"},{"key":"2022122207401830400_ref8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TST.2014.6867518","article-title":"Parameterized algorithmics for computational social choice: Nine research challenges","volume":"19","author":"Bredereck","year":"2014","journal-title":"Tsinghua Science and Technology"},{"key":"2022122207401830400_ref9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.ic.2016.08.003","article-title":"Prices matter for the parameterized complexity of shift bribery","volume":"251","author":"Bredereck","year":"2016","journal-title":"Information and Computation"},{"key":"2022122207401830400_ref10","doi-asserted-by":"crossref","DOI":"10.24963\/ijcai.2017\/124","article-title":"Manipulating opinion diffusion in social networks","volume-title":"Proceedings of IJCAI \u201817","author":"Bredereck","year":"2017"},{"key":"2022122207401830400_ref11","first-page":"2452","article-title":"Complexity of shift bribery in committee elections","volume-title":"Proceedings of AAAI \u201816","author":"Bredereck","year":"2016"},{"key":"2022122207401830400_ref12","first-page":"130","article-title":"Pairwise diffusion of preference rankings in social networks","volume-title":"Proceedings of IJCAI \u201816","author":"Brill","year":"2016"},{"key":"2022122207401830400_ref13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/1557019.1557047","article-title":"Efficient influence maximization in social networks","volume-title":"Proceedings of KDD \u201809","author":"Chen","year":"2009"},{"key":"2022122207401830400_ref14","first-page":"7103","article-title":"Convergence of opinion diffusion is PSPACE-complete","volume-title":"Proceedings of AAAI \u201820","author":"Chistikov","year":"2020"},{"key":"2022122207401830400_ref15","first-page":"166","article-title":"Stability in binary opinion diffusion","volume-title":"Proceedings of LORI \u201817","author":"Christoff","year":"2017"},{"key":"2022122207401830400_ref16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.mathsocsci.2011.03.006","article-title":"Should social network structure be taken into account in elections?","volume":"64","author":"Conitzer","year":"2012","journal-title":"Mathematical Social Science"},{"key":"2022122207401830400_ref17","first-page":"127","article-title":"Barriers to manipulation in voting","volume-title":"Handbook of Computational Social Choice","author":"Conitzer","year":"2015"},{"key":"2022122207401830400_ref18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0095-8956(86)90064-X","article-title":"An integer analogue of caratheodory\u2019s theorem","volume":"40","author":"Cook","year":"1986","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2022122207401830400_ref19","first-page":"201","article-title":"Exploiting social influence to control elections based on scoring rules","volume-title":"Proceedings of IJCAI \u201819","author":"Cor\u00f2","year":"2019"},{"key":"2022122207401830400_ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"2022122207401830400_ref21","article-title":"The internet in U.S. election campaigns","volume-title":"Routledge Handbook of Internet Politics","author":"Davis","year":"2008"},{"key":"2022122207401830400_ref22","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","article-title":"Multivariate complexity analysis of swap bribery","volume":"64","author":"Dorn","year":"2012","journal-title":"Algorithmica"},{"key":"2022122207401830400_ref23","first-page":"473","article-title":"Approximation algorithms for campaign management","volume-title":"Proceedings of WINE \u201810","author":"Elkind","year":"2010"},{"key":"2022122207401830400_ref24","first-page":"366","article-title":"Algorithms for swap and shift bribery in structured elections","volume-title":"Proceedings of AAMAS \u201820","author":"Elkind","year":"2020"},{"key":"2022122207401830400_ref25","first-page":"299","article-title":"Swap bribery","volume-title":"Proceedings of SAGT \u201809","author":"Elkind","year":"2009"},{"key":"2022122207401830400_ref26","first-page":"219","article-title":"Opinion diffusion and campaigning on society graphs","volume-title":"Proceedings of IJCAI \u201818","author":"Faliszewski","year":"2018"},{"key":"2022122207401830400_ref27","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","article-title":"How hard is bribery in elections?","volume":"35","author":"Faliszewski","year":"2009","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2022122207401830400_ref28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.3136","article-title":"Multimode control attacks on elections","volume":"40","author":"Faliszewski","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2022122207401830400_ref29","doi-asserted-by":"crossref","first-page":"103520","DOI":"10.1016\/j.artint.2021.103520","article-title":"Approximation and hardness of shift-bribery","volume":"298","author":"Faliszewski","year":"2021","journal-title":"Artificial Intelligence"},{"key":"2022122207401830400_ref30","first-page":"146","article-title":"Control and bribery in voting","volume-title":"Handbook of Computational Social Choice","author":"Faliszewski","year":"2015"},{"key":"2022122207401830400_ref31","article-title":"Disinformation and social bot operations in the run up to the 2017 French presidential election","volume":"22","author":"Ferrara","year":"2017","journal-title":"First Monday"},{"key":"2022122207401830400_ref32","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1017\/CBO9781107446984.005","article-title":"Weighted tournament solutions","volume-title":"Handbook of Computational Social Choice","author":"Fischer","year":"2016"},{"key":"2022122207401830400_ref33","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"2022122207401830400_ref34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","article-title":"Fixed-parameter algorithms for closest string and related problems","volume":"37","author":"Gramm","year":"2003","journal-title":"Algorithmica"},{"key":"2022122207401830400_ref35","article-title":"Social choice and social networks","volume-title":"Trends in Computational Social Choice","author":"Grandi","year":"2017"},{"key":"2022122207401830400_ref36","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v32i1.11479","article-title":"Committee selection with intraclass and interclass synergies","volume-title":"Proceedings of AAAI \u201818","author":"Izsak","year":"2018"},{"key":"2022122207401830400_ref37","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1080\/19331681.2015.1132401","article-title":"Twitter use in election campaigns: A systematic literature review","volume":"13","author":"Jungherr","year":"2016","journal-title":"Journal of Information Technology & Politics"},{"key":"2022122207401830400_ref38","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v35i6.16693","article-title":"Multi-party campaigning","volume-title":"Proceedings of AAAI \u201821","author":"Kouteck\u00fd","year":"2021"},{"key":"2022122207401830400_ref39","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10458-019-09403-3","article-title":"Algorithms for destructive shift bribery","volume":"33","author":"Kaczmarczyk","year":"2019","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"article-title":"The Omega calculator and library","year":"1996","author":"Kelly","key":"2022122207401830400_ref40"},{"key":"2022122207401830400_ref41","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny","year":"1959","journal-title":"Daedalus"},{"key":"2022122207401830400_ref42","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","article-title":"Maximizing the spread of influence through a social network","volume-title":"Proceedings of KDD \u201803","author":"Kempe","year":"2003"},{"key":"2022122207401830400_ref43","first-page":"1127","article-title":"Influential nodes in a diffusion model for social networks","volume-title":"Proceedings of ICALP \u201805","author":"Kempe","year":"2005"},{"article-title":"A unifying framework for manipulation problems","year":"2018","author":"Knop","key":"2022122207401830400_ref44"},{"key":"2022122207401830400_ref45","first-page":"46:1","article-title":"Voting and bribing in single-exponential time","volume-title":"Proceedings of STACS \u201817","author":"Knop","year":"2017"},{"key":"2022122207401830400_ref46","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra, Jr.","year":"1983","journal-title":"Mathematics of Operations Research"},{"key":"2022122207401830400_ref47","first-page":"182","article-title":"TaPAS: The Talence Presburger arithmetic suite","volume-title":"Procedings of TACAS \u201809","author":"Leroux","year":"2009"},{"key":"2022122207401830400_ref48","first-page":"1567","article-title":"Complexity of shift bribery in iterative elections","volume-title":"Proceedings of AAMAS \u201818","author":"Maushagen","year":"2018"},{"key":"2022122207401830400_ref49","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7624","article-title":"Convergence to equilibria in plurality voting","volume-title":"Proceedings of AAAI \u201810","author":"Meir","year":"2010"},{"key":"2022122207401830400_ref50","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/1467-937X.00121","article-title":"Contagion","volume":"67","author":"Morris","year":"2000","journal-title":"The Review of Economic Studies"},{"key":"2022122207401830400_ref51","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"2022122207401830400_ref52","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","article-title":"Local majorities, coalitions and monopolies in graphs: A review","volume":"282","author":"Peleg","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"2022122207401830400_ref53","first-page":"2040","article-title":"Ranked voting on social networks","volume-title":"Proocedings of IJCAI \u201815","author":"Procaccia","year":"2015"},{"key":"2022122207401830400_ref54","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00199-017-1084-6","article-title":"Condorcet domains, median graphs and the single-crossing property","volume":"67","author":"Puppe","year":"2017","journal-title":"Economic Theory"},{"key":"2022122207401830400_ref55","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-23105-1","volume-title":"Diffusion in Social Networks","author":"Shakarian","year":"2015"},{"key":"2022122207401830400_ref56","first-page":"415","article-title":"On elections with robust winners","volume-title":"Proceedings of AAMAS \u201813","author":"Shiryaev","year":"2013"},{"key":"2022122207401830400_ref57","first-page":"187","article-title":"Opinion manipulation in social networks","volume-title":"Proceedings of NETGCOOP \u201816","author":"Silva","year":"2016"},{"key":"2022122207401830400_ref58","first-page":"705","article-title":"Adapting the social network to affect elections","volume-title":"Proceedings of AAMAS \u201815","author":"Sina","year":"2015"},{"key":"2022122207401830400_ref59","first-page":"633","article-title":"Structured proportional representation","volume-title":"Proceedings of AAMAS \u201817","author":"Talmon","year":"2017"},{"key":"2022122207401830400_ref60","first-page":"368","article-title":"The echo chamber: Strategic voting and homophily in social networks","volume-title":"Proceedings of AAMAS 2016","author":"Tsang","year":"2016"},{"key":"2022122207401830400_ref61","first-page":"265","article-title":"Controlling elections through social influence","volume-title":"Proceedings of AAMAS \u201818","author":"Wilder","year":"2018"},{"key":"2022122207401830400_ref62","first-page":"1665","article-title":"Parameterized complexity of shift bribery in iterative elections","volume-title":"Proceedings of AAMAS \u201820","author":"Zhou","year":"2020"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/32\/6\/1162\/48320213\/exac014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/32\/6\/1162\/48320213\/exac014.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T07:46:19Z","timestamp":1671695179000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/32\/6\/1162\/6550815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":62,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,3,21]]},"published-print":{"date-parts":[[2022,9,6]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exac014","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published-other":{"date-parts":[[2022,9]]},"published":{"date-parts":[[2022,3,21]]}}}