Name
Abstract | ||
|---|---|---|
We consider an opinion network of multiple individuals with dynamics evolving via a general time-varying continuous time consensus algorithm. In such a network, a subset of individuals forms an eminence grise coalition (EGC) if the individuals in that subset are capable of leading the entire network to agreeing on any desired opinion through a cooperative choice of their own initial opinions. In this endeavor, the coalition members are assumed to have access to full profile of the coupling graph of the network as well as the initial opinions of all other individuals. We establish the existence of a minimum size EGC and develop a nontrivial set of tight upper and lower bounds on that size. Thus, even when the coupling graph does not guarantee convergence to a global or multiple consensus, a generally restricted coalition of individuals can steer public opinion toward a desired consensus, provided they can cooperatively adjust their own initial opinions. Geometric insights into the structure of EGCs are also given. |
Year | Venue | Field |
|---|---|---|
2017 | IEEE Trans. Control of Network Systems | Convergence (routing),Graph,Consensus algorithm,Mathematical optimization,Markov process,Upper and lower bounds,Control theory,Public opinion,Control system,Mathematics |
DocType | Volume | Issue |
Journal | 4 | 2 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sadegh Bolouki | 1 | 18 | 6.92 |
| Roland P. Malhamé | 2 | 220 | 31.40 |
| Milad Siami | 3 | 122 | 15.65 |
| Nader Motee | 4 | 181 | 28.18 |