Controlling network coordination games
Stéphane DurandDepartment of Mathematical Sciences “G.L. Lagrange”, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, ItalyGiacomo ComoDepartment of Mathematical Sciences “G.L. Lagrange”, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, ItalyFabio FagnaniDepartment of Mathematical Sciences “G.L. Lagrange”, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy
ABI
Annotatsiya
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.
Hali tarjima qilinmagan
Mavzular
Identifikatorlar
Iqtiboslar va manbalar
0 ta iqtibos13 ta foydalanilgan manba