Social similarity as a driver for selfish, cooperative and altruistic behavior

This paper explores how the degree of similarity within a social group can be exploited in order to dictate the behavior of the individual nodes, so as to best accommodate the typically non-coinciding individual and social benefit maximization. More specifically, this paper investigates the impact of social similarity on the effectiveness of content dissemination, as implemented through three classes representing well the spectrum of behavior-shaped content storage strategies: the selfish, the self-aware cooperative and the optimally altruistic ones. This study shows that when the social group is tight (high degree of similarity), the optimally altruistic behavior yields the best performance for both the entire group (by definition) and the individual nodes (contrary to typical expectations). When the group is made up of foreigners with almost no similarity, altruism or cooperation cannot bring much benefits to either the group or the individuals and thus, a selfish behavior would make sense due to its simplicity. Finally, the self-aware cooperative behavior could be adopted as an easy to implement distributed scheme — compared to the optimally altruistic one — that has close to the optimal performance for tight social groups, and has the additional advantage of not allowing mistreatment to any node (i.e., the content retrieval cost become larger compared to the cost of the selfish strategy).

[1]  Jerome L. Myers,et al.  Research Design and Statistical Analysis , 1991 .

[2]  Iacopo Carreras,et al.  Social Opportunistic Computing: Design for Autonomic User-Centric Systems , 2010, Autonomic Communication.

[3]  Ioannis Stavrakakis,et al.  Joint interest- and locality-aware content dissemination in social networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[4]  Marilyn Wolf,et al.  Effective caching of Web objects using Zipf's law , 2000, 2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532).

[5]  Philip S. Yu,et al.  Replication Algorithms in a Remote Caching Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[6]  Kon Shing Kenneth Chung,et al.  Exploring Temporal Communication Through Social Networks , 2007, INTERACT.

[7]  Nikolaos Laoutaris,et al.  Distributed Selfish Replication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[8]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[9]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[10]  John Scott Social Network Analysis , 1988 .

[11]  Roch Guérin,et al.  Quantifying content consistency improvements through opportunistic contacts , 2009, CHANTS '09.

[12]  Svante Janson,et al.  Measures of similarity between distributions , 1986 .

[13]  S. Kullback,et al.  Information Theory and Statistics , 1959 .

[14]  Vito Latora,et al.  Impact of altruism on opportunistic communications , 2009, 2009 First International Conference on Ubiquitous and Future Networks.

[15]  Jerome L. Myers,et al.  Research design and statistical analysis, 2nd ed. , 2003 .