Analyzing the Theoretical Performance of Information Sharing

April 2010

Analyzing the Theoretical Performance of Information Sharing

Authors:

Paul Scerri, Prasanna Velagapudi, and Katia Sycara

Abstract:

Individuals in large, heterogeneous teams will commonly produce sensor data that is likely useful to some other members of the team, but it is not precisely known to whom the information is useful. Some recent work has shown that randomly propagating the information performed surprisingly well, compared to infeasible optimal approaches. This chapter extends that work by looking at how the relative performance of random information passing algorithms scales with the size of the team. Additionally, the chapter looks at how random information passing performs when sensor data is noisy, so that individuals need multiple pieces of data to reach a conclusion, and the underlying situation is dynamic, so individuals need new information over time. Results show that random information passing is broadly effective, although relative performance is lower in some situations.
@incollection{Scerri-2010-10500,
author = {Paul Scerri And Prasanna Velagapudi And Katia Sycara},
title = {Analyzing the Theoretical Performance of Information Sharing},
booktitle = {Dynamics of Information Systems: Theory and Applications},
chapter = {7},
year = {2010},
month = {April},
pages = {145 - 164},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.