Published January 2015
| public
Journal Article
Manufacturing Consent
Abstract
We consider a variant of the gossip algorithm wherein a controller can influence the values at a subset of nodes as well as the averaging weights. This leads to three optimization problems: (i) Optimal choice of nodes: a combinatorial optimization problem for which we propose a nonlinear programming relaxation as well as a greedy heuristic; (ii) Parametric optimization of weights: a non-convex optimization for which we propose an effective heuristic for a special case; (iii) Dynamic adjustment of weights: an optimal control problem. For the dynamic case, we note some empirically observed interesting critical phenomena for the uncontrolled case.
Additional Information
© 2014 IEEE. Manuscript received March 19, 2012; revised November 21, 2012, September 25, 2013, and May 17, 2014; accepted August 14, 2014. Date of publication August 20, 2014; date of current version December 22, 2014. This work was presented in part at the Allerton Conference on Communication, Control, and Computing, 2010 and 2011 and the MIT Workshop on Social Networks, 2011. This work was supported by a grant from Global GM R&D India Science Lab, Bangalore, by a J. C. Bose Fellowship from the Government of India, and by a summer fellowship from the Indian Science Academies. Recommended by Associate Editor G. N. Nair. V. S. Borkar thanks Prof. A. S. Vasudevamurthy for some useful pointers to the literature. The work of S. Nalli and part of the work of J. Nair was done while visiting Tata Institute of Fundamental Research.Additional details
- Eprint ID
- 54283
- Resolver ID
- CaltechAUTHORS:20150202-093703510
- Global GM R&D India Science Lab
- Government of India J. C. Bose Fellowship
- Indian Science Academies
- Created
-
2015-02-02Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field