Reasoning about Consensus when Opinions Diffuse through Majority Dynamics

@inproceedings{Auletta2018ReasoningAC,
title={Reasoning about Consensus when Opinions Diffuse through Majority Dynamics},
author={Vincenzo Auletta and Diodato Ferraioli and Gianluigi Greco},
booktitle={IJCAI},
year={2018}
}
• Published in IJCAI 1 July 2018
• Mathematics
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…
31 Citations

Figures from this paper

On the Complexity of Opinion Consensus under Majority Dynamics
• Mathematics
ICTCS
• 2019
It is shown that if there are only two available opinions, no matter of the underlying social graph G = (N,E), there is always a group formed by a half of the agents that can annihilate the opposite opinion.
Maximizing the Spread of an Opinion when Tertium Datur Est
• Computer Science
AAMAS
• 2019
Deciding whether there exists a dynamics that can spread the opinion white to at least k agents or can reach a consensus is shown to be intractable, formally $\NP$-hard and islands of tractability based on certain structural properties of the interaction graph are identified.
Dynamics of opinion formation under majority rules on complex social networks
• Computer Science
Scientific Reports
• 2020
It is revealed that in densely-connected social networks, all individuals tend to converge to having a single global consensus, however, in sparsely-connected networks, the systems may exhibit rich properties where coexistence of different opinions, and more interestingly, multiple steady states of coexistence can be observed.
Biased Opinion Dynamics: When the Devil is in the Details
• Mathematics, Computer Science
IJCAI
• 2020
It is believed that the model proposed is at the same time simple, rich, and modular, affording mathematical characterization of the interplay between bias, underlying opinion dynamics, and social structure in a unified setting.
Lifting Majority to Unanimity in Opinion Diffusion
• Computer Science
ECAI
• 2020
The goal is to derive graphtheoretic features of the network that guarantee whenever a majority of individuals initially have the same opinion, they will eventually spread the opinion to all individuals.
Multi-Issue Opinion Diffusion under Constraints
• Computer Science
AAMAS
• 2019
This paper studies the diffusion of constrained opinions on a social network as an iterated process of aggregating neighbouring opinions as well as identifying classes of integrity constraints on which propositionwise updates decrease the influence gap between nodes of the network and their influencers caused by the presence of an integrity constraint.
Multi-Issue Opinion Diffusion under Constraints
• Computer Science
• 2019
This paper studies the diffusion of constrained opinions on a social network as an iterated process of aggregating neighbouring opinions as well as identifying classes of integrity constraints on which propositionwise updates decrease the influence gap between nodes of the network and their influencers caused by the presence of an integrity constraint.
Opinion Diffusion in Competitive Environments: Relating Coverage and Speed of Diffusion
• Mathematics
COMPLEX NETWORKS
• 2019
It is shown that the final configuration of the network strongly depends on their relative speed of diffusion, and how the number of agents that will eventually adopt an opinion is related with the speed of propagation of that opinion is characterized.

References

SHOWING 1-10 OF 42 REFERENCES
Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks
• Computer Science
APPROX-RANDOM
• 2014
It is proved that for networks that are sparse and expansive, the population will converge to the correct opinion with high probability, and on the other hand, it is shown that there exist networks for which consensus is unlikely, or for which declarations converge on the incorrect opinion with positive probability.
Minority Becomes Majority in Social Networks
• Economics
WINE
• 2015
The case in which agents express preferences over two alternatives and model social pressure with the majority dynamics is considered: at each step an agent is selected and its preference is replaced by the majority of the preferences of her neighbors.
Manipulating Opinion Diffusion in Social Networks
• Computer Science
IJCAI
• 2017
Several ways of manipulating the majority opinion in a stable outcome are considered, such as bribing agents, adding/deleting links, and changing the order of updates, and the computational complexity of the associated problems is investigated.
Propositional Opinion Diffusion
• Computer Science
AAMAS
• 2015
A formal model of opinion diffusion and formation is presented which combines notions from social network analysis together with concepts and techniques from judgment aggregation and merging to study the propagation of individual opinions in a multiagent system linked by an influence network.
Majority dynamics and aggregation of information in social networks
• Economics, Mathematics
Autonomous Agents and Multi-Agent Systems
• 2013
A family of examples in which interaction prevents efficient aggregation of information, and a condition on the social network which ensures that aggregation occurs, is constructed, which shows that if the initial population is sufficiently biased towards a particular alternative then that alternative will eventually become the unanimous preference of the entire population.
Strategic Disclosure of Opinions on a Social Network: (Extended Abstract)
• Economics
AAMAS
• 2016
It is shown that games of influence provide a simple abstraction to explore the effects of the trust network structure on the agents' behaviour, by considering solution concepts from game-theory such as Nash equilibrium, weak dominance and winning strategies.
Social Pressure in Opinion Games
• Computer Science
IJCAI
• 2017
It is proved that for clique social networks, the dynamics always converges to consensus if the social pressure is high enough, and bounds are polynomial in the number of players provided that the pressure grows sufficiently fast.
Stability in Binary Opinion Diffusion
• Computer Science
LORI
• 2017
Stabilization of the process of diffusion of binary opinions on networks is studied in terms of neighborhood structures, and how the monotone $$\mu$$-calculus can express relevant properties of them is shown.
Pairwise Diffusion of Preference Rankings in Social Networks
• Economics
IJCAI
• 2016
This work introduces a model of preference diffusion in which agents in a social network update their preferences based on those of their influencers in the network, and considers both a synchronous and an asynchronous variant of this model.
Group Reasoning in Social Environments
• Economics
AAMAS
• 2017
A thoroughly computational complexity analysis is conducted on the problem of deciding the existence of stable outcomes and the convergence of Nash dynamics consisting of sequences of best response updates is studied, too.