Agents and Peer-to-Peer Computing

This paper discusses altruistic sharing achieved by tags in an agent society where sharing information incurs a cost and non-sharing is thus the preferred option for selfish agents. We believe that the general features of our tagging mechanism can be used to facilitate altruism and increase the overall social welfare in artificial societies. We describe our findings based on experiments we have conducted through multi-agent-based simulation of artificial societies in the context of agents playing the knowledge-sharing game.

[1]  Peter Druschel,et al.  Storage management and caching in PAST , 2001 .

[2]  Petter Ögren,et al.  Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[3]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[4]  Lei Yu,et al.  A Conceptual Framework for Agent Oriented and Role Based Workflow Modelling , 1999 .

[5]  L. N. Foner,et al.  A multi-agent, referral based matchmaking system , 1997 .

[6]  Sandip Sen,et al.  The Success and Failure of Tag-Mediated Evolution of Cooperation , 2005, LAMAS.

[7]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[8]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[9]  Naoyasu Ubayashi,et al.  RoleEP: role based evolutionary programming for cooperative mobile agent applications , 2000, Proceedings International Symposium on Principles of Software Evolution.

[10]  R. Riolo,et al.  Evolution of cooperation without reciprocity , 2001, Nature.

[11]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[12]  Liam Wagner,et al.  Byzantine Agreements in Secure Communication , 2003, ArXiv.

[13]  Andrzej Duda,et al.  Discover: A Resource Discovery System Based on Content Routing , 1995, Comput. Networks ISDN Syst..

[14]  Yves Deswarte,et al.  Intrusion tolerance in distributed computing systems , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[15]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[16]  Brian Randell,et al.  Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach , 1994, EDCC.

[17]  Amit P. Sheth,et al.  Discovery of Web services in a federated registry environment , 2004 .

[18]  Franco Zambonelli,et al.  Developing multiagent systems: The Gaia methodology , 2003, TSEM.

[19]  Ernst Fehr,et al.  Detrimental effects of sanctions on human altruism , 2003, Nature.

[20]  Pierre Chevaillier,et al.  oRis : un environnement de simulation interactive multi-agents , 2002, Tech. Sci. Informatiques.

[21]  Patrice Perny,et al.  Search for Compromise Solutions in Multiobjective State Space Graphs , 2006, ECAI.

[22]  Franco Zambonelli,et al.  Organisational Rules as an Abstraction for the Analysis and Design of Multi-Agent Systems , 2001, Int. J. Softw. Eng. Knowl. Eng..

[23]  Munindar P. Singh,et al.  Emergent properties of referral systems , 2003, AAMAS '03.

[24]  Maryam Purvis,et al.  Mechanisms for Cooperative Behaviour in Agent Institutions , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[25]  Kevin Leyton-Brown,et al.  Incentives for sharing in peer-to-peer networks , 2001, EC '01.

[26]  Ralph L. Keeney,et al.  Decisions with multiple objectives: preferences and value tradeoffs , 1976 .

[27]  Vincenzo Gervasi,et al.  Coordination without communication: the case of the flocking problem , 2004, Discret. Appl. Math..

[28]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[29]  Bruce Edmonds,et al.  Evolving social rationality for MAS using "tags" , 2002, AAMAS '03.

[30]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[31]  Munindar P. Singh,et al.  Community-based service location , 2001, CACM.

[32]  Amit P. Sheth,et al.  METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services , 2005, Inf. Technol. Manag..

[33]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[34]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[35]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1998 .

[36]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[37]  Munindar P. Singh,et al.  Searching social networks , 2003, AAMAS '03.

[38]  Ben Y. Zhao,et al.  Pond: The OceanStore Prototype , 2003, FAST.

[39]  Sandip Sen,et al.  Reciprocity: a foundational principle for promoting cooperative behavior among self-interested agents , 1996 .

[40]  M. Nowak,et al.  Evolution of indirect reciprocity by image scoring , 1998, Nature.

[41]  Marek Karpinski,et al.  An XOR-based erasure-resilient coding scheme , 1995 .

[42]  Munindar P. Singh,et al.  Incentive Mechanisms for Peer-to-Peer Systems , 2003, AP2PC.

[43]  Adi Shamir,et al.  How to share a secret , 1979, CACM.