Vidal's library
Title: Yenta: A Multi-Agent, Referral Based Matchmaking System
Author: Leonard N. Foner
Book Tittle: Proceedings of The First International Conference on Autonomous Agents
Year: 1997
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. As an example, this paper describes a matchmaker system, designed to find people with similar interests and introduce them to each other. The matchmaker is designed to introduce everyone , unlike conventional Internet media which only allow those who take the time to speak in public to be known. The paper details how the agents that make up the matchmaking system can function in a decentralized fashion, yet 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. Several prototypes of various parts of the system have been implemented, and the most recent results, including simulations of up to 1000 such agents, are presented.

Cited by 154  -  Google Scholar

@InProceedings{foner97a,
  author =	 {Leonard N. Foner},
  title =	 {Yenta: A Multi-Agent, Referral Based Matchmaking
                  System},
  googleid =	 {VyNjFYIlzIgJ:scholar.google.com/},
  booktitle =	 {Proceedings of The First International Conference on
                  Autonomous Agents},
  year =	 1997,
  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. As an example, this paper describes
                  a matchmaker system, designed to find people with
                  similar interests and introduce them to each
                  other. The matchmaker is designed to introduce
                  everyone , unlike conventional Internet media which
                  only allow those who take the time to speak in
                  public to be known. The paper details how the agents
                  that make up the matchmaking system can function in
                  a decentralized fashion, yet 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. Several prototypes of various parts of the
                  system have been implemented, and the most recent
                  results, including simulations of up to 1000 such
                  agents, are presented.},
  keywords =     {recommender trust},
  url =		 {http://jmvidal.cse.sc.edu/library/foner97a.pdf},
  comment =	 {Forms clusters of agents. Their formation is the
                  main contribution of the system. Agents are assumed
                  to be honest---there is no incentive-compatible
                  protocol since there are no selfish agents.},
  cluster = 	 {9857294925041967959}
}
Last modified: Wed Mar 9 10:14:18 EST 2011