Manufacturing consent

@article{Borkar2010ManufacturingC,
  title={Manufacturing consent},
  author={Vivek S. Borkar and Aditya Karnik and Jayakrishnan Nair and Sanketh Nalli},
  journal={2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2010},
  pages={1550-1555}
}
  • V. Borkar, A. Karnik, S. Nalli
  • Published 1 September 2010
  • Computer Science, Mathematics
  • 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
A scheme for consensus formation is considered wherein the value of a certain variable associated with the nodes of a network is fixed a priori for a prescribed set of K nodes, and allowed to propagate throughout the network through an averaging process that mimics a gossip algorithm. The objective is to find the best choice of these K nodes that will achieve the fastest convergence to consensus. This objective is captured by the Perron-Frobenius eigenvalue of the resultant sub-stochastic… 

Tables from this paper

Optimizing Leader Influence in Networks Through Selection of Direct Followers
  • V. Mai, E. Abed
  • Computer Science
    IEEE Transactions on Automatic Control
  • 2019
TLDR
The main technical novelties of this work are in the establishment of supermodularity of the objective function and convexity of its continuous relaxation.
Resource Allocation for Wireless Networks: A Distributed Optimization Approach
TLDR
The multi-cell joint power control and scheduling problem in cellular wireless networks is considered as a weighted sum-rate maximization problem, and a localized version of the algorithm is proposed, exploiting the nature of the objective function.
Controlled gossip
  • V. Borkar, A. Karnik
  • Computer Science, Mathematics
    2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2011
We consider a variant of the gossip algorithm wherein a controller can influence the values at a subset of the nodes as well as the transition probabilities. This leads to a parametric optimization
Maintaining Ferment
TLDR
This work argues that the optimal state-action trajectories exhibit the ‘turnpike’ property, i.e., the state and the control variables remain close to the equilibrium for all but a finite number of time instants.
Submodularity in Dynamics and Control of Networked Systems
TLDR
This book presents a framework for the control of networked systems utilizing submodular optimization techniques, which is the first unifying approach towards guaranteeing both performance and controllability with provable optimality bounds in static as well as time-varying networks.
Opinion Control Competition in a Social Network
  • Mohak Goyal, D. Manjunath
  • Economics
    2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)
  • 2020
TLDR
This work determines the Nash control strategies for both the controllers and proves a key structural result on these strategies that gives insights on how campaigns should distribute their effort and ad spend.
Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
TLDR
This paper studies leader selection in order to minimize convergence errors experienced by the follower agents, and introduces a novel connection to random walks on the network graph that shows that the convergence error has an inherent supermodular structure as a function of the leader set.
Opinion shaping in social networks using reinforcement learning
TLDR
This paper considers classical opinion dynamics with some stubborn agents and the possibility of continuously influencing the opinions of a few selected agents, albeit under resource constraints, and proposes two different online two-time scale reinforcement learning schemes that converge to the optimal solution of each problem.
Naïve Learning in Social Networks and the Wisdom of Crowds
TLDR
It is shown that all opinions in a large society converge to the truth if and only if the influence of the most influential agent vanishes as the society grows.
PROJECT IDENTIFICATION PROPOSAL N ° : ( to be filled by IFCAM ) Application of optimal control and game theory in communication networks
1. IFCAM will consider and support proposals for collaborative advanced research between scientists / institutions in India and scientists / institutions in France. Proposals can be made in any area
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Controlled gossip
  • V. Borkar, A. Karnik
  • Computer Science, Mathematics
    2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2011
We consider a variant of the gossip algorithm wherein a controller can influence the values at a subset of the nodes as well as the transition probabilities. This leads to a parametric optimization
Fastest Mixing Markov Chain on a Graph
TLDR
The Lagrange dual of the fastest mixing Markov chain problem is derived, which gives a sophisticated method for obtaining (arbitrarily good) bounds on the optimal mixing rate, as well as the optimality conditions.
An analysis of approximations for maximizing submodular set functions—I
TLDR
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Spectral partitioning of random graphs
  • Frank McSherry
  • Computer Science, Mathematics
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
TLDR
This paper shows that a simple spectral algorithm can solve all three problems above in the average case, as well as a more general problem of partitioning graphs based on edge density.
Reaching a Consensus
Abstract Consider a group of individuals who must act together as a team or committee, and suppose that each individual in the group has his own subjective probability distribution for the unknown
Naïve Learning in Social Networks and the Wisdom of Crowds
TLDR
It is shown that all opinions in a large society converge to the truth if and only if the influence of the most influential agent vanishes as the society grows.
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.
Convergent activation dynamics in continuous time networks
  • M. Hirsch
  • Mathematics, Computer Science
    Neural Networks
  • 1989
...
1
2
3
4
5
...