Abstract
We study the problem of distributed, self-interested agents searching for high-quality service providers where the performance of a service provider depends on its work load. Agents use referrals from peers to locate satisfactory providers. While stable environments may facilitate fast convergence to satisfying states, greedy and myopic behaviors by distributed agents can lead to poor and variable performances for the entire community. We present mechanisms for resource discovery that involve learning, over interactions, both the performance levels of different service providers as well as the quality of referrals provided by other agents. We study parameters controlling system performance to better comprehend the reasons behind the observed performances of the proposed coordination schemes.
This work has been supported in part by an NSF award IIS-0209208.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goodrich, M.A., Stimpson, J.L.: Learning to cooperate in a social dilemma: A satisficing approach to bargaining. In: International Conference on Machine Learning, pp. 728–735 (2003)
March, J.G., Simon, H.A.: Models of Man, New York (1958)
Simon, H.A.: Models of Man, New York (1957)
Russell, S.J.,, D.S.: Provably bounded-optimal agents. In: Journal of Articial Intelligence Research (1995)
Sen, S., Sajja, N.: Robustness of reputation-based trust: boolean case. In: AAMAS 2002: Proceedings of the first international joint conference on Autonomous agents and multiagent systems, pp. 288–293. ACM Press, New York (2002)
Sen, S., Arora, N., Roychowdhury, S.: Using limited information to enhance group stability. Int. J. Hum.-Comput. Stud. 48, 69–82 (1998)
Rustogi, S.K., Singh, M.P.: Be patient and tolerate imprecision: How autonomous agents can coordinate effectively. In: IJCAI 1999: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, San Francisco, CA, USA, pp. 512–519. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Candale, T., Erete, I., Sen, S. (2005). Using Inertia and Referrals to Facilitate Satisficing Distributions. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_65
Download citation
DOI: https://doi.org/10.1007/11603771_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)