Asynchronous opinion dynamics on the k-nearest-neighbors graph

Wilbert Samuel Rossi, Paolo Frasca

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)

    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.

    Original languageEnglish
    Title of host publication2018 IEEE Conference on Decision and Control, CDC 2018
    PublisherIEEE
    Pages3648-3653
    Number of pages6
    ISBN (Electronic)9781538613955
    DOIs
    Publication statusPublished - 18 Jan 2019
    Event57th IEEE Conference on Decision and Control 2018 - Fontainebleau Miami Beach, Miami Beach, United States
    Duration: 17 Dec 201819 Dec 2018
    Conference number: 57
    https://cdc2018.ieeecss.org/

    Publication series

    NameProceedings of the IEEE Conference on Decision and Control
    Volume2018-December
    ISSN (Print)0743-1546

    Conference

    Conference57th IEEE Conference on Decision and Control 2018
    Abbreviated titleCDC 2018
    CountryUnited States
    CityMiami Beach
    Period17/12/1819/12/18
    Internet address

    Fingerprint

    Dive into the research topics of 'Asynchronous opinion dynamics on the k-nearest-neighbors graph'. Together they form a unique fingerprint.

    Cite this