{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/opinion-dynamics-with-varying-susceptibility","title":"Opinion Dynamics with Varying Susceptibility to Persuasion","arxiv_id":"1801.07863","date":"2018-01-24","proceeding":null,"authors":["Rediet Abebe","Jon Kleinberg","David Parkes","Charalampos E. Tsourakakis"],"abstract":"A long line of work in social psychology has studied variations in people's\nsusceptibility to persuasion -- the extent to which they are willing to modify\ntheir opinions on a topic. This body of literature suggests an interesting\nperspective on theoretical models of opinion formation by interacting parties\nin a network: in addition to considering interventions that directly modify\npeople's intrinsic opinions, it is also natural to consider interventions that\nmodify people's susceptibility to persuasion. In this work, we adopt a popular\nmodel for social opinion dynamics, and we formalize the opinion maximization\nand minimization problems where interventions happen at the level of\nsusceptibility.\n  We show that modeling interventions at the level of susceptibility lead to an\ninteresting family of new questions in network opinion dynamics. We find that\nthe questions are quite different depending on whether there is an overall\nbudget constraining the number of agents we can target or not. We give a\npolynomial-time algorithm for finding the optimal target-set to optimize the\nsum of opinions when there are no budget constraints on the size of the\ntarget-set. We show that this problem is NP-hard when there is a budget, and\nthat the objective function is neither submodular nor supermodular. Finally, we\npropose a heuristic for the budgeted opinion optimization and show its efficacy\nat finding target-sets that optimize the sum of opinions compared on real world\nnetworks, including a Twitter network with real opinion estimates.","url_abs":"http://arxiv.org/abs/1801.07863v1","url_pdf":"http://arxiv.org/pdf/1801.07863v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"opinion-dynamics-with-varying-susceptibility","repo_url":"https://github.com/tsourolampis/opdyn-social-influence","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.07863","atlas_url":"https://app.syntology.ai/?focus=1801.07863","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}