Manufacturing consent

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1550-1555

  Borkar, Vivek S ^a   Nair, Jayakrishnan ^b   Sanketh, Nalli ^c  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BEST CHOICE; CONSENSUS FORMATION; EIGEN-VALUE; GOSSIP ALGORITHMS; GREEDY SCHEME; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES; PERRON-FROBENIUS; STOCHASTIC MATRICES;

EIGENVALUES AND EIGENFUNCTIONS;

ALGORITHMS;

EID: 79952369072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5707097     Document Type: Conference Paper

References (15)

1. D. Shah, Gossip Algorithms. Now Publishers, 2009.
2. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Review, vol. 46, no. 4, pp. 667-689, 2004.
3. H. Boyle and R. Dykstra, "A method for finding projections onto the intersection of convex sets in Hilbert space," in Advances in Order Restricted Statistical Inference, ser. Lecture Notes in Statistics. Springer Verlag, 1985, pp. 28-47.
4. S.-P. Han, "A successive projection method," Mathematical Programming, vol. 40, pp. 1-14, 1988.
5. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Comput. Netw. ISDN Syst., vol. 30, no. 1-7, pp. 107-117, 1998.
6. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," J. ACM, vol. 46, no. 5, pp. 604-632, 1999.
7. M. Jackson, Social and Economic Networks. Princeton University Press, 2008.
8. N. Maculan, C. Santiago, E. Macambira, and M. Jardim, "An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn," Journal of Optimization Theory and Applications, vol. 117, pp. 553-574, 2003.
9. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, "An analysis of approximations for maximizing submodular set functions - I," Mathematical Programming, vol. 14, pp. 265-294, 1978.
10. R. Sundaram, A First Course in Optimization Theory. Cambridge University Press, 1996.
11. G. H. Golub and C. F. Van Loan, Matrix computations (3rd ed.). Baltimore, MD, USA: Johns Hopkins University Press, 1996.
12. W. Zachary, "An information flow model for conflict and fission in small groups," Journal of Anthropological Research, vol. 33, no. 4, pp. 452-473, 1977.
13. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Phys. Rev. E, vol. 74, no. 3, 2006.
14. V. Borkar and S. Meyn, "Risk-sensitive optimal control for Markov decision processes with monotone cost," Mathematics of Operations Research, vol. 27, no. 1, pp. 192-209, 2002.
15. V. Borkar, "Convex analytic methods in Markov decision processes," in Markov Decision Processes: Models, Methods, Directions and Open Problems, E. Feinberg and A. Shwartz, Eds. Kluwer Academic, 2001, pp. 347-375.