title: Information sharing and sorting in a community.
abstract: We present the results of a detailed numerical study of a model for the sharing and sorting of information in a community consisting of a large number of agents. The information gathering takes place in a sequence of mutual bipartite interactions where randomly selected pairs of agents communicate with each other to enhance their knowledge and sort out the common information. Although our model is less restricted compared to the well-established naming game, the numerical results strongly indicate that the whole set of exponents characterizing this model are different from those of the naming game and they assume nontrivial values. Finally, it appears that in analogy to the emergence of clusters in the phenomenon of percolation, one can define clusters of agents here having the same information. We have studied in detail the growth of the largest cluster in this article and performed its finite-size scaling analysis.
authors.affiliation: Satyendra Nath Bose National Centre for Basic Sciences, Block-JD, Sector-III, Salt Lake, Kolkata 700098, India.
authors.forename: Biplab
authors.initials: B
authors.lastname: Bhattacherjee
authors.forename: S S
authors.initials: SS
authors.lastname: Manna
authors.forename: Animesh
authors.initials: A
authors.lastname: Mukherjee
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D005716:Game Theory; D033181:Information Dissemination / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical; D012919:Social Behavior