Consensus over evolutionary graphs

Nikolaos M. Freris, Hamidou Tembine

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to delete existing ones in a selfish and decentralized fashion, as indicated by a certain randomized mechanism. This model incurs a time-varying and state-dependent graph topol- ogy for which traditional consensus analysis is not applicable. We prove asymptotic average consensus almost surely and in mean square for any initial condition and graph topology. In addition, we establish exponential convergence in expectation. Our results are validated via simulation studies on random networks.

Original languageEnglish (US)
Title of host publication2018 European Control Conference, ECC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9783952426982
StatePublished - Nov 27 2018
Event16th European Control Conference, ECC 2018 - Limassol, Cyprus
Duration: Jun 12 2018Jun 15 2018

Publication series

Name2018 European Control Conference, ECC 2018


Conference16th European Control Conference, ECC 2018


  • Consensus
  • Distributed Algorithms
  • Evolutionary Games
  • Evolutionary Graphs
  • Randomized Algorithms

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Control and Optimization


Dive into the research topics of 'Consensus over evolutionary graphs'. Together they form a unique fingerprint.

Cite this