Controlling network coordination games

Stéphane Durand, Giacomo Como, Fabio Fagnani

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.