Manufacturing Consent

Author

Borkar, Vivek S. ; Karnik, Aditya ; Nair, Jisha M. ; Nalli, Sanketh

Author_Institution

Tata Inst. of Fundamental Res., Mumbai, India

Volume

60

Issue

1

fYear

2015

fDate

Jan. 2015

Firstpage

104

Lastpage

117

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.

Keywords

combinatorial mathematics; concave programming; dynamic programming; greedy algorithms; nonlinear programming; optimal control; averaging weights; combinatorial optimization problem; critical phenomena; dynamic weight adjustment; empirical analysis; gossip algorithm; greedy heuristic; manufacturing consent; node subset values; nonconvex optimization; nonlinear programming relaxation; optimal control problem; optimal node choice; optimization problems; parametric weight optimization; Convergence; Greedy algorithms; Heuristic algorithms; Markov processes; Optimal control; Optimization; Social network services; Gossip algorithms; opinion dynamics; optimal control; optimal node placement;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/TAC.2014.2349591

Filename

6880763