Controlling network coordination games
Computer Science and Game Theory
2019-12-18 v1 Optimization and Control
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 garantees.
Keywords
Cite
@article{arxiv.1912.07859,
title = {Controlling network coordination games},
author = {Stephane Durand and Giacomo Como and Fabio Fagnani},
journal= {arXiv preprint arXiv:1912.07859},
year = {2019}
}
Comments
submitted to the conference IFAC