Effect of referrals on convergence to satisficing distributions

  • Authors:
  • Teddy Candale;Sandip Sen

  • Affiliations:
  • University of Tulsa;University of Tulsa

  • Venue:
  • Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate a framework where agents locate high-quality service providers by using referrals from peer agents. The performance of providers is measured by the satisfaction obtained by agents from using their services. Provider performance depends upon its intrinsic capability and upon its current load. We present an algorithm for selecting a service provider for a given task which includes mechanisms for deciding when and who to ask for a referral. This mechanism requires learning, over interactions, both the performance levels of different service providers, as well as the quality of referrals provided by other agents. We use a satisficing rather than an optimizing framework, where agents are content to receive service quality above a threshold. Agents have to learn the quality of others' referrals and the quality of providers to find satisficing providers. We compare the effectiveness of referral systems with or without deception with systems without referrals. We identify zones, based on an observed entropy metric, where using referrals is helpful in promoting fast convergence to satisficing distributions.