Consensus over evolutionary graphs

Nikolaos M. Freris; Hamidou Tembine

doi:10.23919/ECC.2018.8550392

Consensus over evolutionary graphs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	2018 European Control Conference, ECC 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2218-2223
Number of pages	6
ISBN (Electronic)	9783952426982
DOIs	https://doi.org/10.23919/ECC.2018.8550392
State	Published - Nov 27 2018
Event	16th European Control Conference, ECC 2018 - Limassol, Cyprus Duration: Jun 12 2018 → Jun 15 2018

Publication series

Name	2018 European Control Conference, ECC 2018

Conference

Conference	16th European Control Conference, ECC 2018
Country	Cyprus
City	Limassol
Period	6/12/18 → 6/15/18

Fingerprint

Keywords

Consensus
Distributed Algorithms
Evolutionary Games
Evolutionary Graphs
Randomized Algorithms

ASJC Scopus subject areas

Control and Systems Engineering
Control and Optimization

Cite this

Freris, N. M., & Tembine, H. (2018). Consensus over evolutionary graphs. In 2018 European Control Conference, ECC 2018 (pp. 2218-2223). [8550392] (2018 European Control Conference, ECC 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ECC.2018.8550392

@inproceedings{fd5f6ed0d1c840868175c40212a9484c,

title = "Consensus over evolutionary graphs",

abstract = "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.",

keywords = "Consensus, Distributed Algorithms, Evolutionary Games, Evolutionary Graphs, Randomized Algorithms",

author = "Freris, {Nikolaos M.} and Hamidou Tembine",

year = "2018",

month = nov

day = "27",

doi = "10.23919/ECC.2018.8550392",

language = "English (US)",

series = "2018 European Control Conference, ECC 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2218--2223",

booktitle = "2018 European Control Conference, ECC 2018",

note = "16th European Control Conference, ECC 2018 ; Conference date: 12-06-2018 Through 15-06-2018",

}

TY - GEN

T1 - Consensus over evolutionary graphs

AU - Freris, Nikolaos M.

AU - Tembine, Hamidou

PY - 2018/11/27

Y1 - 2018/11/27

N2 - 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.

AB - 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.

KW - Consensus

KW - Distributed Algorithms

KW - Evolutionary Games

KW - Evolutionary Graphs

KW - Randomized Algorithms

UR - http://www.scopus.com/inward/record.url?scp=85059801443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059801443&partnerID=8YFLogxK

U2 - 10.23919/ECC.2018.8550392

DO - 10.23919/ECC.2018.8550392

M3 - Conference contribution

AN - SCOPUS:85059801443

T3 - 2018 European Control Conference, ECC 2018

SP - 2218

EP - 2223

BT - 2018 European Control Conference, ECC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 16th European Control Conference, ECC 2018

Y2 - 12 June 2018 through 15 June 2018

ER -

Access to Document

10.23919/ECC.2018.8550392