{"type":"ScholarlyArticle","title":"Reasoning about Consensus when Opinions Diffuse through Majority Dynamics","authors":[{"name":"Vincenzo Auletta","slug":"vincenzo-auletta","given":"Vincenzo","family":"Auletta","affiliation":"University of Salerno , Italy"},{"name":"Diodato Ferraioli","slug":"diodato-ferraioli","given":"Diodato","family":"Ferraioli","affiliation":"University of Salerno , Italy"},{"name":"Gianluigi Greco","slug":"gianluigi-greco","given":"Gianluigi","family":"Greco","affiliation":"University of Calabria , Italy"}],"abstract":"Opinion diffusion is studied on social graphs where agents hold binary opinions and where social pressure leads them to conform to the opinion manifested by their neighbors. Within this setting, questions related to whether a minority/majority can spread the opinion it supports to all the other agents are considered.It is shown that, no matter of the graph given at hand, there always exists a group formed by a half of the agents that can annihilate the opposite opinion. Instead, the influence power of minorities depends on certain features of the underlying graphs, which are NP-hard to be identified. Deciding whether the two opinions can coexist in some stable configuration is NP-hard, too.","doi":"10.24963/ijcai.2018/7","url":"https://ijcai.org/proceedings/2018/7","pdf":"https://ijcai.org/proceedings/2018/0007.pdf","markdown":"https://ijcai.org/proceedings/2018/7.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/7","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":7,"pages":{"first":49,"last":55},"keywords":["Agent-based and Multi-agent Systems: Coordination and Cooperation","Agent-based and Multi-agent Systems: Noncooperative Games","Agent-based and Multi-agent Systems: Algorithmic Game Theory"],"videos":[],"references":[{"position":1,"raw":"[Acar et al., 2017] Erman Acar, Gianluigi Greco, and Marco Manna. Group reasoning in social environments. In Proc. of AAMAS'17, pages 1296-1304, 2017.","title":"Group reasoning in social environments","authors":"Erman Acar, Gianluigi Greco, Marco Manna","year":"2017","venue":"Proc. of AAMAS'17","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Auletta et al., 2015] Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Per- siano. Minority becomes majority in social networks. In Proc. of WINE'15, pages 74-88, 2015.","title":"Minority becomes majority in social networks","authors":"Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe","year":"2015","venue":"Proc. of WINE'15","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Auletta et al., 2017a] Vincenzo Auletta, Ioannis Caragian- nis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Per- siano. Information retention in heterogeneous majority dy- namics. In Proc. of WINE'17, pages 30-43, 2017.","title":"Information retention in heterogeneous majority dynamics","authors":"Auletta","year":"2017","venue":"Proc. of WINE'17","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Auletta et al., 2017b] Vincenzo Auletta, Ioannis Caragian- nis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Per- siano. Robustness in discrete preference games. In Proc. of AAMAS '17, pages 1314-1322, 2017.","title":"Robustness in discrete preference games","authors":"Auletta","year":"2017","venue":"Proc. of AAMAS '17","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brandt et al., 2016] Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia. Handbook of Computational Social Choice. Cambridge University Press, New York, NY, USA, 2016.","title":"Handbook of Computational Social Choice","authors":"Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D Procaccia","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bredereck and Elkind, 2017] Robert Bredereck and Edith Elkind. Manipulating opinion diffusion in social networks. In Proc. of IJCAI'17, pages 894-900, 2017.","title":"Robert Bredereck and Edith Elkind. Manipulating opinion diffusion in social networks","authors":"Elkind Bredereck","year":"2017","venue":"Proc. of IJCAI'17","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brill et al., 2016] Markus Brill, Edith Elkind, Ulle Endriss, and Umberto Grandi. Pairwise diffusion of preference rankings in social networks. In Proc. of IJCAI'2016, pages 130-136, 2016.","title":"Pairwise diffusion of preference rankings in social networks","authors":"Markus Brill, Edith Elkind, Ulle Endriss, Umberto Grandi","year":"2016","venue":"Proc. of IJCAI'2016","doi":null,"url":null,"internal_url":"/proceedings/2016/26"},{"position":8,"raw":"[Chen, 2008] Ning Chen. On the approximability of influ- ence in social networks. In Proc. of SODA'08, pages 1029- 1037, 2008.","title":"On the approximability of influence in social networks","authors":"Chen ; Ning Chen","year":"2008","venue":"Proc. of SODA'08","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cholvy, 2016] Laurence Cholvy. Influence-based opinion diffusion. In Proc. of AAMAS'16, pages 1355-1356, 2016.","title":"Laurence Cholvy. Influence-based opinion diffusion","authors":"Cholvy","year":"2016","venue":"Proc. of AAMAS'16","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Christoff and Grossi, 2017] Zoé Christoff and Davide Grossi. Stability in binary opinion diffusion. In Proc. of LORI '17, pages 166-180, 2017.","title":"Stability in binary opinion diffusion","authors":"Grossi Christoff, Zoé Christoff, Davide Grossi","year":"2017","venue":"Proc. of LORI '17","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Endriss, 2017] Ulle Endriss, editor. Trends in Computa- tional Social Choice. AI Access, 2017.","title":"Trends in Computational Social Choice","authors":null,"year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Feldman et al., 2014] Michal Feldman, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg. Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks. In Proc. of APPROX/RANDOM'14, pages 192-208, 2014.","title":"Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks","authors":"Michal Feldman, Nicole Immorlica, Brendan Lucier, S Matthew Weinberg","year":"2014","venue":"Proc. of APPROX/RANDOM'14","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ferraioli and Ventre, 2017] Diodato Ferraioli and Carmine Ventre. Social pressure in opinion games. In Proc. of IJ- CAI'17, pages 3661-3667, 2017.","title":"Social pressure in opinion games","authors":"Diodato Ferraioli, Carmine Ventre","year":"2017","venue":"Proc. of IJ-CAI'17","doi":null,"url":null,"internal_url":"/proceedings/2017/512"},{"position":14,"raw":"[Garey and Johnson, 1979] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"Michael R Garey, David S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gottlob et al., 2005] Georg Gottlob, Gianluigi Greco, and Francesco Scarcello. Pure nash equilibria: Hard and easy games. Journal of Artificial Intigence Research, 24(1):357-406, 2005.","title":"Pure nash equilibria: Hard and easy games","authors":"Gottlob","year":"2005","venue":"Journal of Artificial Intigence Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Grandi et al., 2015] Umberto Grandi, Emiliano Lorini, and Laurent Perrussel. Propositional opinion diffusion. In Proc. of AAMAS'15, pages 989-997, 2015.","title":"Propositional opinion diffusion","authors":"Umberto Grandi, Emiliano Lorini, Laurent Perrussel","year":"2015","venue":"Proc. of AAMAS'15","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Grandi et al., 2017] Umberto Grandi, Emiliano Lorini, Ari- anna Novaro, and Laurent Perrussel. Strategic disclosure of opinions on a social network. In Proc. of AAMAS'17, pages 1196-1204, 2017.","title":"Strategic disclosure of opinions on a social network","authors":"Umberto Grandi, Emiliano Lorini, Arianna Novaro, Laurent Perrussel","year":"2017","venue":"Proc. of AAMAS'17","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Granovetter, 1978] Mark Granovetter. Threshold models of collective behavior. American journal of sociology, 83(6):1420-1443, 1978.","title":"Threshold models of collective behavior","authors":"Mark Granovetter","year":"1978","venue":"American journal of sociology","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Greenlaw and Petreschi, 1995] Raymond Greenlaw and Rossella Petreschi. Cubic graphs. ACM Computing Surveys, 27(4):471-495, 1995.","title":"Raymond Greenlaw and Rossella Petreschi","authors":"Petreschi Greenlaw","year":"1995","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kempe et al., 2005] David Kempe, Jon Kleinberg, and Éva Tardos. Influential nodes in a diffusion model for social networks. In Proc. of ICALP'05, pages 1127-1138, 2005.","title":"Influential nodes in a diffusion model for social networks","authors":"David Kempe, Jon Kleinberg, Éva Tardos","year":"2005","venue":"Proc. of ICALP'05","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Mossel et al., 2014] Elchanan Mossel, Joe Neeman, and Omer Tamuz. Majority dynamics and aggregation of infor- mation in social networks. Autonomous Agents and Multi- Agent Systems, 28(3):408-429, 2014.","title":"Majority dynamics and aggregation of information in social networks","authors":"Elchanan Mossel, Joe Neeman, Omer Tamuz","year":"2014","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Osborne and Rubinstein, 1994] Martin J. Osborne and Ariel Rubinstein. A course in game theory. The MIT Press, Cambridge, USA, 1994.","title":"A course in game theory","authors":"Martin J Osborne, Ariel Rubinstein","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Yoshinaka, 2005] Ryo Yoshinaka. Higher-order matching in the linear lambda calculus in the absence of constants is np-complete. In Proc. or RTA '05, pages 235-249. 2005.","title":"Higher-order matching in the linear lambda calculus in the absence of constants is np-complete","authors":"Ryo Yoshinaka, Yoshinaka","year":"2005","venue":"Proc. or RTA '05","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}