Controlling network coordination games

Stéphane Durand; Giacomo Como; Fabio Fagnani

doi:10.1016/j.ifacol.2020.12.957

Controlling network coordination games

Stéphane Durand, Giacomo Como, Fabio Fagnani

Polytechnic University of Turin

Research output: Contribution to journal › Article › peer-review

Abstract

We study a novel control problem in the context of network coordination games: the individuation of the smallest set of players capable of driving the system, globally, from one Nash equilibrium to another one. Our main contribution is the design of a randomized algorithm based on a time-reversible Markov chain with provable convergence guarantees.

Original language	English
Pages (from-to)	2862-2867
Journal	IFAC-PapersOnLine
Volume	53
Issue number	2
DOIs	https://doi.org/10.1016/j.ifacol.2020.12.957
Publication status	Published - 2020 Jan 1

Subject classification (UKÄ)

Control Engineering

Access to Document

10.1016/j.ifacol.2020.12.957

https://linkinghub.elsevier.com/retrieve/pii/S2405896320313136

Dynamics of Complex Socio-Technological Network Systems
Tegling, E. (PI), Como, G. (Researcher), Ohlin, D. (Research student), Bencherki, F. (Research student), Govaert, A. (Researcher), Altafini, C. (PI) & Bakovic, L. (Research student)
2021/09/01 → 2026/09/30
Project: Research

Cite this

@article{7978d429a5984f10851fa75ef53f6695,

title = "Controlling network coordination games",

abstract = "We study a novel control problem in the context of network coordination games: the individuation of the smallest set of players capable of driving the system, globally, from one Nash equilibrium to another one. Our main contribution is the design of a randomized algorithm based on a time-reversible Markov chain with provable convergence guarantees.",

author = "St{\'e}phane Durand and Giacomo Como and Fabio Fagnani",

year = "2020",

month = jan,

day = "1",

doi = "10.1016/j.ifacol.2020.12.957",

language = "English",

volume = "53",

pages = "2862--2867",

journal = "IFAC-PapersOnLine",

issn = "2405-8963",

publisher = "IFAC Secretariat",

number = "2",

}

TY - JOUR

T1 - Controlling network coordination games

AU - Durand, Stéphane

AU - Como, Giacomo

AU - Fagnani, Fabio

PY - 2020/1/1

Y1 - 2020/1/1

N2 - We study a novel control problem in the context of network coordination games: the individuation of the smallest set of players capable of driving the system, globally, from one Nash equilibrium to another one. Our main contribution is the design of a randomized algorithm based on a time-reversible Markov chain with provable convergence guarantees.

AB - We study a novel control problem in the context of network coordination games: the individuation of the smallest set of players capable of driving the system, globally, from one Nash equilibrium to another one. Our main contribution is the design of a randomized algorithm based on a time-reversible Markov chain with provable convergence guarantees.

U2 - 10.1016/j.ifacol.2020.12.957

DO - 10.1016/j.ifacol.2020.12.957

M3 - Article

SN - 2405-8963

VL - 53

SP - 2862

EP - 2867

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 2

ER -

Controlling network coordination games

Abstract

Subject classification (UKÄ)

Access to Document

Fingerprint

Projects

Dynamics of Complex Socio-Technological Network Systems

Cite this