When is social computation better than the sum of its parts?

Details When is social computation better than the sum of its parts? When is social computation better than the sum of its parts?

2011-03-24

arxiv.org/abs/1103.4854v1

Computer Science

Information Theory

5 pages, 1 figure; In H. Liu, J. J. Salerno, and M. J. Young, editors, Social Computing, Behavior Modeling, and Prediction, 20

Scientific paper

Social computation, whether in the form of searches performed by swarms of agents or collective predictions of markets, often supplies remarkably good solutions to complex problems. In many examples, individuals trying to solve a problem locally can aggregate their information and work together to arrive at a superior global solution. This suggests that there may be general principles of information aggregation and coordination that can transcend particular applications. Here we show that the general structure of this problem can be cast in terms of information theory and derive mathematical conditions that lead to optimal multi-agent searches. Specifically, we illustrate the problem in terms of local search algorithms for autonomous agents looking for the spatial location of a stochastic source. We explore the types of search problems, defined in terms of the statistical properties of the source and the nature of measurements at each agent, for which coordination among multiple searchers yields an advantage beyond that gained by having the same number of independent searchers. We show that effective coordination corresponds to synergy and that ineffective coordination corresponds to independence as defined using information theory. We classify explicit types of sources in terms of their potential for synergy. We show that sources that emit uncorrelated signals provide no opportunity for synergetic coordination while sources that emit signals that are correlated in some way, do allow for strong synergy between searchers. These general considerations are crucial for designing optimal algorithms for particular search problems in real world settings.

Affiliated with

Also associated with

No associations

Rating

When is social computation better than the sum of its parts? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When is social computation better than the sum of its parts?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When is social computation better than the sum of its parts? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49077