Asynchronous opinion dynamics on the k-nearest-neighbors graph - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Asynchronous opinion dynamics on the k-nearest-neighbors graph

Paolo Frasca

Résumé

This paper is about a new model of opinion dynamics with opinion-dependent 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. We also prove that if the number of agents n is smaller than 2k, the dynamics converge to consensus. This condition is only sufficient.
Fichier principal
Vignette du fichier
root.pdf (521.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01877618 , version 1 (20-09-2018)

Identifiants

Citer

Wilbert Samuel Rossi, Paolo Frasca. Asynchronous opinion dynamics on the k-nearest-neighbors graph. CDC 2018 - 57th IEEE Conference on Decision and Control, Dec 2018, Miami, FL, United States. pp.3648-3653, ⟨10.1109/CDC.2018.8619285⟩. ⟨hal-01877618⟩
80 Consultations
72 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More