Controlling network coordination games

TL;DR

This paper introduces a control problem in network coordination games, aiming to identify minimal influential players to shift the system between equilibria, and proposes a randomized algorithm with proven convergence.

Contribution

It presents a novel control framework and a randomized algorithm for influencing network coordination games, with theoretical convergence guarantees.

Findings

Algorithm successfully identifies minimal control sets

Proven convergence guarantees for the proposed method

Applicable to various network coordination scenarios

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.