2018 IEEE Conference on Decision and Control (CDC) 2018
DOI: 10.1109/cdc.2018.8619285
|View full text |Cite
|
Sign up to set email alerts
|

Asynchronous opinion dynamics on the <tex>$k$</tex>-nearest-neighbors graph

Abstract: This paper is about a new model of opinion dynamics with opiniondependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the k agents that are closest to it. We show that the resulting dynamics is substantially different from comparable models in the literature, such as bounded-confidence models. We study the equilibria of the dynamics, observing that they are robust to perturbations caused by the introduction of new agents.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…If k = 2, then each agent averages her opinion with the closest agent apart himself. For general k, this dynamics was studied in [24]. In this case, there exist non-clustered configurations that are equilibria, see [24] for two examples (one using the tie break rule and one not).…”
Section: Lemma 1 (Clustered Configurations): a Configuration Is Clustered If And Only Ifmentioning
confidence: 99%
See 2 more Smart Citations
“…If k = 2, then each agent averages her opinion with the closest agent apart himself. For general k, this dynamics was studied in [24]. In this case, there exist non-clustered configurations that are equilibria, see [24] for two examples (one using the tie break rule and one not).…”
Section: Lemma 1 (Clustered Configurations): a Configuration Is Clustered If And Only Ifmentioning
confidence: 99%
“…For general k, this dynamics was studied in [24]. In this case, there exist non-clustered configurations that are equilibria, see [24] for two examples (one using the tie break rule and one not). Instead, for m < n, the following result shows that all equilibria are clustered configurations.…”
Section: Lemma 1 (Clustered Configurations): a Configuration Is Clustered If And Only Ifmentioning
confidence: 99%
See 1 more Smart Citation
“…Among first order "opinion" models, [1] has recently used Petri nets to define a class of models where interactions depend on the opinions of multiple agents: despite some similarities, our model does not belong to this class. In our recent papers [29,28], we have studied two dynamics with asynchronous updates (with and without sub-sampling, respectively) that are discrete-time counterparts of the model we propose here. Finally, our contribution here differs from the one of [2] as the latter focuses on specific properties of the equilibria, such as the distribution of their clusters' sizes, studied by extensive simulations, whereas we are interested in analytical results about dynamical properties like convergence to the equilibria and about their robustness to perturbations.…”
Section: Introductionmentioning
confidence: 99%
“…Touri et al [16] and Etesami et al [17] both considered an asynchronous HK model, in which only one agent is communicating at each time. Rossi et al studied an opinion dynamics on the k-nearest-neighbors graph, which is essentially an asynchronous model [19]. Ding et al considered an asynchronous opinion scenario with online and offline interactions [18].…”
Section: Introductionmentioning
confidence: 99%