Abstract
We investigate a formal framework where agents use referrals from other agents to locate high-quality service providers. Agents have common knowledge about providers which are able to provide these services. The performance of providers is measured by the satisfaction obtained by agents from using their services. Provider performance varies with their current load. We assume that agents are truthful in reporting interaction experiences with providers and refer the highest quality provider known for a given task. The referral mechanism is based of the exchange value theory. Agents exchange both the name of the provider to use and the satisfaction obtained by using a referred provider. 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. We experimentally demonstrate the effectiveness of our algorithm in producing stable system configurations where reasonable satisfaction expectations of all agents are met.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kersten, G.: Nego-group decision support system. Information and Management 8, 237–246 (1985)
March, J.G., Simon, H.A.: Organizations. John Wiley & Sons, Chichester (1958)
Piaget, J.: Sociological Studies, Routlege, London (1995)
Rodrigues, M.R., da Rocha Costa, A.C., Bordini, R.H.: A system of exchange values to support social interactions in artificial societies. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 81–88. ACM Press, New York (2003)
Sen, S., Sajja, N.: Robustness of reputation-based trust: Boolean case. In: Proceedings of the First Intenational Joint Conference on Autonomous Agents and Multiagent Systems, pp. 288–293. ACM Press, New York (2002)
Sen, S., Sajja, N.: Selecting service providers based on reputation. In: Proceedings of the AAAI 2002 Workshop on Multi-Agent Modeling and Simulation of Economic Systems (2002)
Simon, H.A.: Models of Man. John Wiley & Sons, Chichester (1957)
Stimpson, J.L., Goodrich, M.A., Walters, L.C.: Satisficing and learning cooperation in the prisoner’s dilemma. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pp. 535–540 (2001)
Tietz, R., Bartos, O.: Balancing of aspiration levels as fairness principle in negotiations. In: Tietz, R. (ed.) Aspiration Levels in Bargaining and Economic Decision Making, Springer, Berlin (1983)
Weber, H.-J.: Theory of adaptation of aspiration levels in a bilateral decision setting. Zeitschrift für die gesamte Staatswissenschaft, 582–591 (1976)
Yu, B., Singh, M.P.: Searching social networks. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 65–72. ACM Press, New York (2003)
Zionts, S., Stewart, T., Lotfi, V.: An aspiration-level interactive model for multiple criteria decision making. Computers in Operations Research 19(7), 671–681 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Candale, T., Sen, S. (2006). Learning to Use Referrals to Select Satisficing Service Providers. In: Hinchey, M.G., Rago, P., Rash, J.L., Rouff, C.A., Sterritt, R., Truszkowski, W. (eds) Innovative Concepts for Autonomic and Agent-Based Systems. WRAC 2005. Lecture Notes in Computer Science(), vol 3825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964995_2
Download citation
DOI: https://doi.org/10.1007/11964995_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69265-2
Online ISBN: 978-3-540-69266-9
eBook Packages: Computer ScienceComputer Science (R0)