Abstract
Many important and useful applications for software agents require multiple agents on a network that communicate with each other. Such agents must find each other and perform a useful joint computation without having to know about every other such agent on the network. This paper describes Yenta, a matchmaker system designed to find people with similar interests and introduce them to each other. It describes how the agents that make up the matchmaking system can function in a decentralised fashion, yet can group themselves into clusters which reflect their users' interests. These clusters are then used to make introductions or allow users to send messages to others who share their interests. The algorithm uses referrals from one agent to another in the same fashion that word-of-mouth is used when people are looking for an expert. A prototype of the system has been implemented, and the results of its use are presented.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Lashkari Y, Metral M and Maes P: ‘Collaborative Interface Agents,’ Proceedings of the Twelfth National Conference on Artificial Intelligence, MIT Press, Cambridge, MA (1994).
Maes P: ‘Agents that Reduce Work and Information Overload', Communications of the ACM, 37, No 7 (July 1994).
Kozierok R and Maes P: ‘A Learning Interface Agent for Meeting Scheduling,’ Proceedings of the 1993 International Workshop on Intelligent User Interfaces, ACM Press, New York (1993).
Foner L N: ‘What's an Agent, Anyway? A Sociological Case Study,’ Agents Memo 93-01, MIT Media Lab, Cambridge, MA, (1993).
Mauldin M: ‘ChatterBots, TinyMuds, and the Turing Test: Entering the Loebner Prize Competition,’ Proceedings of the Twelfth National Conference on Artificial Intelligence, MIT Press, Cambridge, MA, (1994).
Fisk D: ‘Application of Social Filtering to Movie Recommendation', BT Technol J, 14, No 4, pp 124–132 (October 1996).
Shardanand U and Maes P: 'social Information Filtering: Algorithms for Automating Word of Mouth', Proceedings of the CHI '95 Conference (1995).
Mockapetris P: ‘Domain names — implementation and specification,’ Internet RFC1034 (1987), /http://fuzine.mc.cs.cmu.edu/mlm/aaai94.html/s
Horton M and Adams R: 'standard for interchange of USENET messages,’ Internet RFC1036, ftp://ds.internic.net/rfc/rfc1036.txt (1987).
Huberman B A (Ed): ‘The Ecology of Computation', Elsevier Science Publishers B V (1988).
Foner L N: ‘A Multi-Agent Referral System for Matchmaking', PAAM'96 Proceedings, pp 245–262 (April 1996).
Foner L N: ‘Clustering and Information Sharing in an Ecology of Cooperating Agents, or How to Gossip without Spilling the Beans,’ Proceedings of the Conference on Computers, Freedom, and Privacy, Student Paper Winner, Burlingame, CA (1995).
Foner L N: ‘Clustering and Information Sharing in an Ecology of Cooperating Agents,’ AAAI '95 Spring Symposium Workshop Notes on Information Gathering in Distributed, Heterogeneous Environments, Stanford, CA, http://www.isi.edU/sims/knoblock/sss95/foner.ps (1995).
Kuokka D and Harada L: ‘Matchmaking for Information Agents,’ Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (1995).
Kautz H, Milewski A and Selman B: ‘Agent Amplified Communication,’ AAAI '95 Spring Symposium Workshop Notes on Information Gathering in Distributed, Heterogeneous Environments, Stanford, CA (1995).
Zumoff J: ‘Users Manual for the SMART Information Retrieval System,’ Cornell Technical Report 71-95 (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Foner, L., Crabtree, I.B. (1997). Multi-agent matchmaking. In: Nwana, H.S., Azarmi, N. (eds) Software Agents and Soft Computing Towards Enhancing Machine Intelligence. Lecture Notes in Computer Science, vol 1198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62560-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-62560-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62560-5
Online ISBN: 978-3-540-68079-6
eBook Packages: Springer Book Archive