@inbook{10.2307/j.ctt1287k9b.13,
ISBN = {9780691140612},
URL = {http://www.jstor.org/stable/j.ctt1287k9b.13},
abstract = {Our first example, which has a strong resemblance to the agreement problem, is inspired by considering a social network of friends, viewed as nodes in an undirected graphG, that adopt a certain level of “fashionability,” measured in terms of a real number on the unit interval [0, 1]. Thus${x_i}(k) = 1$and${x_j}(k) = 1$refer to the scenario where nodesiandjare, respectively, the most and least fashionable a member of the social group can be at time indexk. Let us initialize the group fashionability state atk= 0 by choosing$0 \leqslant {x_i}(0) \leqslant 1,i = 1,2,...,n,$which can be done, for},
bookauthor = {Mehran Mesbahi and Magnus Egerstedt},
booktitle = {Graph Theoretic Methods in Multiagent Networks},
edition = {STU - Student edition},
pages = {226--250},
publisher = {Princeton University Press},
title = {Social Networks, Epidemics, and Games},
year = {2010}
}