Does more connectivity help groups to solve social problems

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2011, Pages 21-26

  Enemark, Daniel P ^a   McCubbins, Mathew D ^b   Paturi, Ramamohan ^a   Weller, Nicholas ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

coordination; game theory; graph coloring; human subject experiments; social network

Indexed keywords

COLLECTIVE ACTION; CONSTRAINT SATISFACTION PROBLEMS; COORDINATION PROBLEMS; COORDINATION TASKS; EXPERIMENTAL STUDIES; GRAPH COLORING; HIGHER NETWORKS; HUMAN NETWORKS; HUMAN-SUBJECT EXPERIMENTS; NETWORK CONNECTION; POSITIVE EFFECTS; PROBLEM COMPLEXITY; SOCIAL NETWORKS; SOCIAL PROBLEMS;

COORDINATION REACTIONS; ELECTRONIC COMMERCE; GAME THEORY;

PROBLEM SOLVING;

EID: 79959580481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993574.1993578     Document Type: Conference Paper

References (32)

1. E. Abrahamson and L. Rosenkopf. Social network effects on the extent of innovation diffusion: A computer simulation. Organization Science, 8(3):289-309, May 1997.
2. D. Achlioptas and F. Ricci-Tersenghi. On the solution-space geometry of random constrain satisfaction problems. In Symposium on Theory of Computing, pages 130-139, Seattle, Washington, May 2006. Association for Computing Machinery, Association for Computing Machinery.
3. Amiri, Ehsan, and Skvortsov, Evgeny. Pushing Random Walk Beyond Golden Ratio. In Diekert, Volker, Volkov, Mikhail, and Amiri, Ehsan, editors, Computer Science - Theory and Applications, pages 44-55. Springer Berlin, 2007.
4. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
5. N. Barnier and P. Brisset. Graph coloring for air traffic flow management. Annals of Operations Research, 130:167-178, August 2005.
6. R. L. Berger. A necessary and sufficient condition for reaching consensus using degroot's method. Journal of the American Statistical Association, 76:415-418, 1981.
7. S. P. Borgatti, A. Mehra, D. J. Brass, and G. Labianca. Network analysis in the social sciences. Science, 323(5916):892-895, February 2009.
8. E. Bueno de Mesquita and M. Stephenson. Legal institutions and informal networks. Journal of Theoretical Politics, 18(1):40-67, 2006. (Pubitemid 43188639)
9. C. Calabro, R. Impagliazzo, and R. Paturi. A duality between clause width and clause density for sat. In CCC '06: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, Washington, DC, 2006. IEEE Computer Society.
10. A. Calvó-Armengol and J. de Martì. Communication networks: Knowledge and decisions. American Economic Review, 97(2):86-91, May 2007.
11. K. Chaudhuri, F. Chung, and M.S. Jamall. A network coloring game. In Proceedings of the 4th International Workshop on Internet and Network Economics, pages 552-530, 2008.
12. N. Christakis and J. Fowler. The spread of obesity in a large social netowrk over 32 years. New England Journal of Medicine, 357:370-379, July 2007. (Pubitemid 47124137)
13. M. Chwe. Communication and coordination in social networks. Review of Economic Studies, 67:1-16, 2000.
14. M. R. Garey and D. S. Johnson. The complexity of near-optimal graph coloring. Journal of the Association for Computing Machinery, 23(1):43-49, January 1976.
15. J. Hagenbach and F. Koessler. Strategic communication networks. February 2009.
16. M. Jackson. Social and Economic Networks. Princeton University Press, Princeton, New Jersey, 2008.
17. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, The IBM Research Symposia Series, pages 85-103, New York, NY, 1972. Plenum Press.
18. M. Kearns, S. Suri, and N. Montfort. An experimental study of the coloring problem on human subject networks. Science, 313:824-827, August 2006. (Pubitemid 44223348)
19. S. O. Krumke, M. V. Marathe, and S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks, 7(6):575-584, November 2001. (Pubitemid 33091055)
20. M. D. McCubbins, R. Paturi, and N. Weller. Connected coordination: Network structure and group coordination. American Politics Research, 37:899-920, September 2009.
21. R. Paturi, P. Pudlák, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-sat. Journal of the Association for Computing Machinery, 52(3):337-364, 2005. (Pubitemid 43078376)
22. E. Rasmusen. Games and Information: An Introduction to Game Theory. Blackwell Publishers, Oxford, England, 4 edition, 2006.
23. R. B. Rothenberg, J. J. Potterat, D. E. Woodhouse, S. Q. Muth, W. W. Darrow, and A. S. Klovdahl. Social network dynamics and hiv transmission. AIDS, 12:1529-1536, April 1998.
24. J. T. Scholz, R. Berardo, and B. Kile. Do networks solve collective action problems? credibility, search, and collaboration. Journal of Politics, 70(2):393-406, April 2008.
25. U. Schöning. A probabilistic algorithm for k-sat and constraint satisfaction problems. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Washington, DC, 1999. IEEE Computer Society.
26. F. Schweitzer, G. Fagiolo, D. Sornette, F. Vega-Redondo, A. Vespignani, and D. R. White. Economic networks: The new challenges. Science, 325:422-425, July 2009.
27. D. Siegel. Social networks and collective action. American Journal of Political Science, 53(1):122-138, 2009.
28. S. H. Strogatz. From kuramoto to crawford: exploring the onset of synchronization in populations of coupled oscillators. Physica D: Nonlinear Phenomena, 143:1-20, 2000.
29. L. G. Valiant and V. V. Vazirani. Np is as easy as detecting unique solutions. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 458-463, New York, NY, 1985.
30. P. Van Mieghem, J. Omic, and R. Kooij. Virus spread in networks. IEEE/ACM Transactions on Networking, 17(1):1-14, February 2009.
31. D. J. Watts. Six Degrees: The Science of a Connected Age. W.W. Norton & Company, Inc., New York, NY, 2003.
32. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, June 1