Engineering self-organizing referral networks for trustworthy service selection

Developing, maintaining, and disseminating trust in open, dynamic environments is crucial. We propose self-organizing referral networks as a means for establishing trust in such environments. A referral network consists of autonomous agents that model others in terms of their trustworthiness and disseminate information on others' trustworthiness. An agent may request a service from another; a requested agent may provide the requested service or give a referral to someone else. Possibly with its user's help, each agent can judge the quality of service obtained. Importantly, the agents autonomously and adaptively decide with whom to interact and choose what referrals to issue, if any. The choices of the agents lead to the evolution of the referral network, whereby the agents move closer to those that they trust. This paper studies the guidelines for engineering self-organizing referral networks. To do so, it investigates properties of referral networks via simulation. By controlling the actions of the agents appropriately, different referral networks can be generated. This paper first shows how the exchange of referrals affects service selection. It identifies interesting network topologies and shows under which conditions these topologies emerge. Based on the link structure of the network, some agents can be identified as authorities. Finally, the paper shows how and when such authorities emerge. The observations of these simulations are then formulated into design recommendations that can be used to develop robust, self-organizing referral networks.

[1]  Salima Hassas,et al.  Self-organisation: Paradigms and applications , 2003 .

[2]  Steven Johnson,et al.  Emergence: The Connected Lives of Ants, Brains, Cities, and Software , 2001 .

[3]  Munindar P. Singh,et al.  Self-Organizing Referral Networks: A Process View of Trust and Authority , 2003, Engineering Self-Organising Systems.

[4]  Henry Kautz,et al.  Combining social networks and collaborative ?ltering , 1997 .

[5]  Ramon Sangüesa,et al.  Extracting reputation in multi agent systems by means of social network topology , 2002, AAMAS '02.

[6]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[7]  Munindar P. Singh,et al.  An agent-based approach to knowledge management , 2002, CIKM '02.

[8]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[9]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

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

[11]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  A. Oram.  Peer-to-Peer , 2001 .

[14]  Munindar P. Singh,et al.  Dynamic communities in referral networks , 2003, Web Intell. Agent Syst..

[15]  V. Buskens.  The social structure of trust , 1998 .

[16]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

[17]  Onn Shehory.  A Scalable Agent Location Mechanism , 1999, ATAL.

[18]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[19]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[20]  Munindar P. Singh,et al.  Trustworthy Service Caching: Cooperative Search in P2P Information Systems , 2003, AOIS.

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

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

[23]  Jordi Sabater-Mir,et al.  Reputation and social network analysis in multi-agent systems , 2002, AAMAS '02.

[24]  Fang Wang,et al.  Self-organising communities formed by middle agents , 2002, AAMAS '02.