Opinion dynamics in social networks: A local interaction game with stubborn agents

Proceedings of the American Control Conference

Volumn , Issue , 2013, Pages 1982-1987

  Ghaderi, Javad ^a   Srikant, R ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE SPEED; COST MINIMIZATION; LOCAL INTERACTION GAMES; LOCAL INTERACTIONS; NETWORK STRUCTURES; NETWORKED INTERACTIONS; OPINION DYNAMICS; SMALL WORLD GRAPHS;

CONTROL ENGINEERING;

EID: 84883500339     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2013.6580126     Document Type: Conference Paper

References (31)

1. M. H. DeGroot, Reaching a consensus, Journal of the American Statistical Association, vol. 69, no. 345, pp. 118-121, 1974.
2. G. Ellison and D. Fundenberg, Rules of thumb for social learning. Journal of Political Economy, vol. 110, no. 1, pp. 93-126, 1995.
3. R. Hegselmann, U. Krause, Opinion dynamics and bounded confidence models, analysis, and simulations, Journal of Artifical Societies and Social Simulation (JASSS), vol. 5, no. 3, 2002
4. P. Bremaud, Markov chains, Gibbs fields, Monte Carlo simulation, and queues, Springer-Verlag, New York 1999, 2nd edition, 2001.
5. D. Shah, Gossip Algorithms, Foundations and Trends in Networking, nol. 3, no. 1, 2008.
6. M. Kandori, H. J. Mailath and F. Rob, Learning, mutation, and long run equilibria in games, Econometrica, vol. 61, pp. 29-56, 1993.
7. A. Clark and R. Poovendran, A Submodular optimization framework for leader selection in linear multi-agent systems, IEEE Conference on Decision and Control, Orlando, December 12-15, 2011.
8. J. Kleinberg, Cascading behavior in networks: algorithmic and economic issues, Algorithmic Game Theory, Cambridge University Press, 2007.
9. G. Ellison, Learning, local interactions, and coordination, Econometrica, vol. 61, pp. 1047-1071, 1993.
10. V. S. Borkar, J. Nair, and N. Sanketh, Manufacturing consent, Allerton Conference on Communication, Control, and Computing, 2010.
11. S. Bikchandani, D. Hirshleifer, and I. Welch, A theory of fads, fashion, custom, and cultural change as information cascades, Journal of Political Economy, vol. 100, pp. 992-1026, 1992.
12. A. Banerjee and D. Fudenberg, Word-of-mouth learning, Games and Economic Behavior, vol. 46, pp. 1-22, 2004.
13. D. Acemoglu, M. Dahleh, I. Lobel, and A. Ozdaglar, Bayesian learning in social networks, The Review of Economic Studies, 2011.
14. D. Acemoglu, A. Ozdaglar, and A. ParandehGheibi, Spread of (mis)information in social networks, Games and Economic Behavior, vol. 70, no. 2, pp. 194-227, 2010.
15. E. Yildiz, D. Acemoglu, A. Ozdaglar, A. Saberi, and A. Scaglione, Discrete Opinion Dynamics with Stubborn Agents, submitted, 2011.
16. J. N. Tsitsiklis, Problems in decentralized decision making and computation, Ph. D. Thesis, Department of EECS, MIT, 1984.
17. J. N. Tsitsiklis, D. P. Bertsekas and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Transactions on Automatic Control, vol. 31, no. 9, pp. 803-812, 1986.
18. A. Olshevsky and J. N. Tsitsiklis, Convergence speed in distributed consensus and averaging, SIAM Journal on Control and Optimization, 2008.
19. A. Jadbabaie, J. Lin, and S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic Control vol. 48, no. 6, 988-1001, 2003.
20. R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge University Press, 1985.
21. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability, vol. 1, pp. 36-61, 1991.
22. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combinatorics, Probability and Computing, vol. 1, pp. 351-370, 1992.
23. A. Montarani, A. Saberi, Convergence to equilibrium in local interaction games, FOCS Conference, 2009.
24. M. Draief and L. Massoulie, Epidemics and rumours in complex networks, Cambridge University Press, 2010.
25. S. Milgram, The small word problem, Psychology Today, vol. 1, no. 1, pp. 61-67, 1967.
26. D. Watts, Small worlds: The dynamics of networks between order and randomness, Princeton University Press, 1999.
27. J. Kleinberg, The small-world phenomenon: an algorithmic perspective, ACM Symposium on Theory of Computing, pp. 163-170, 2000.
28. A. Flaxman, Expansion and lack thereof in randomly perturbed graphs, Internet Mathematics, vol. 4, no. 2, pp. 131-147, 2007.
29. N. Alon and V. D. Milman, 1, isoperimetric inequalities for graphs, and superconcentrators, Journal of Combin. Theory Ser. B, vol. 38 no. 1, pp. 73-88, 1985.
30. M. E. J. Newman, Power laws, Pareto distributions and Zipf's law, available online at http://arxiv. org/pdf/cond-mat/0412004. pdf.
31. J. Ghaderi and R. Srikant, Opinion dynamics in social networks: A local interaction game with stubborn agents, http://arxiv. org/abs/1208. 5076.