Asynchronous opinion dynamics on the k-nearest-neighbors graph

Abstract : 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.
Type de document :
Communication dans un congrès
57th IEEE Conference on Decision and Control (CDC 2018), Dec 2018, Miami Beach, United States
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01877618
Contributeur : Paolo Frasca <>
Soumis le : jeudi 20 septembre 2018 - 10:11:14
Dernière modification le : vendredi 28 septembre 2018 - 10:20:50

Fichier

root.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01877618, version 1

Collections

Citation

Wilbert Rossi, Paolo Frasca. Asynchronous opinion dynamics on the k-nearest-neighbors graph. 57th IEEE Conference on Decision and Control (CDC 2018), Dec 2018, Miami Beach, United States. 〈hal-01877618〉

Partager

Métriques

Consultations de la notice

29

Téléchargements de fichiers

9