Related papers: Single-Peaked Opinion Updates
We analyse opinion diffusion in social networks, where a finite set of individuals is connected in a directed graph and each simultaneously changes their opinion to that of the majority of their influencers. We study the algorithmic…
We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing…
We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading…
The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability $p$. In order to discriminate the better and…
We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other competing campaigns, so as to maximize a voting-based score for…
The focus of this work is on designing influencing strategies to shape the collective opinion of a network of individuals. We consider a variant of the voter model where opinions evolve in one of two ways. In the absence of external…
Several elections run in the last years have been characterized by attempts to manipulate the result of the election through the diffusion of fake or malicious news over social networks. This problem has been recognized as a critical issue…
In this article, I investigate the use of Bayesian updating rules applied to modeling social agents in the case of continuos opinions models. Given another agent statement about the continuous value of a variable $x$, we will see that…
In this work we are interested in the modelling and control of opinion dynamics spreading on a time evolving network with scale-free asymptotic degree distribution. The mathematical model is formulated as a coupling of an opinion alignment…
The goal of opinion maximization is to maximize the positive view towards a product, an ideology or any entity among the individuals in social networks. So far, opinion maximization is mainly studied as finding a set of influential nodes…
The classic influence maximization problem finds a limited number of influential seed users in a social network such that the expected number of influenced users in the network, following an influence cascade model, is maximized. The…
The paper studies the problem of steering multi-dimensional opinion in a social network. Assuming the society of desire consists of stubborn and regular agents, stubborn agents are considered as leaders who specify the desired opinion…
This paper proposes and analyzes a novel multi-agent opinion dynamics model in which agents have access to actions which are quantized version of the opinions of their neighbors. The model produces different behaviors observed in social…
We investigate opinion dynamics in a fully-connected system, consisting of $n$ identical and anonymous agents, where one of the opinions (which is called correct) represents a piece of information to disseminate. In more detail, one source…
We analyze the evolution of political organizations using a model in which agents change their opinions via two competing mechanisms. Two agents may interact and reach consensus, and additionally, individual agents may spontaneously change…
The process by which new ideas, innovations, and behaviors spread through a large social network can be thought of as a networked interaction game: Each agent obtains information from certain number of agents in his friendship neighborhood,…
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced.…
We study the process of information dispersal in a network with communication errors and local error-correction. Specifically we consider a simple model where a single bit of information initially known to a single source is dispersed…
We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' opinions, their own previous opinions, and external media…