A Protocol for a Distributed Recommender System
We present a domain model and protocol for the exchange of recommendations by selfish agents without the aid of any centralized control. Our model captures a subset of the realities of recommendation exchanges in the Internet. We provide an algorithm that selfish agents can use for deciding whether to exchange recommendations and with whom. We analyze this algorithm and show that, under certain common circumstances, the agents’ rational choice is to exchange recommendations. Finally, we have implemented our model and algorithm and tested the performance of various populations. Our results show that both the social welfare and the individual utility of the agents is increased by participating in the exchange of recommendations.
Unable to display preview. Download preview PDF.
- 3.Axelrod, R.M.: The Evolution of Cooperation. Basic Books, Newyork (1984)Google Scholar
- 7.Foner, L.N.: Yenta: A multi-agent, referral based matchmaking system. In: Proceedings of The First International Conference on Autonomous Agents (1997)Google Scholar
- 10.Oram, A. (ed.): Peer-to-Peer. O’Reilly, Sebastopol (2001)Google Scholar
- 11.Adar, E., Huberman, B.A.: Free riding on gnutella. First Monday (2000)Google Scholar
- 12.Yu, B., Singh, M.P.: An evidential model of distributed reputation management. In: Proceedings of the 1st International Joint Conference on Autonomous Agents and MultiAgent Systems, pp. 294–301 (2002)Google Scholar
- 14.Yu, B., Singh, M.P., Sycara, K.: Developing trust in large-scale peer-to-peer systems. In: Proceedings of First IEEE Symposium on Multi-Agent Security and Survivability, pp. 1–10 (2004)Google Scholar
- 16.Yu, B., Li, C., Singh, M.P., Sycara, K.: A dynamic pricing mechanism for p2p referral systems. In: Proceedings of Third International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 1426–1427 (2004)Google Scholar