Provider: JSTOR http://www.jstor.org
Database: JSTOR
Content: text/plain; charset="us-ascii"
TY - CHAP
TI - Social Networks, Epidemics, and Games
A2 - Mesbahi, Mehran
A2 - Egerstedt, Magnus
AB - 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 graph*G*, 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 nodes*i*and*j*are, respectively, the most and least fashionable a member of the social group can be at time index*k*. Let us initialize the group fashionability state at*k*= 0 by choosing$0 \leqslant {x_i}(0) \leqslant 1,i = 1,2,...,n,$which can be done, for

EP - 250
ET - STU - Student edition
PB - Princeton University Press
PY - 2010
SN - 9780691140612
SP - 226
T2 - Graph Theoretic Methods in Multiagent Networks
UR - http://www.jstor.org/stable/j.ctt1287k9b.13
Y2 - 2021/09/19/
ER -