Abstract
Agent discovery and pairing is a core process for many multi-agent applications and enables the coordination of agents in order to contribute to the achievement of organisational-level objectives. Previous studies in peer-to-peer and sensor networks have shown the efficiency of probabilistic algorithms in object or resource discovery. In this paper we maintain confidence in such mechanisms and extend the work for the purpose of agent discovery for useful pairs that eventually coordinate to enhance their collective performance. The key difference in our mechanism is the use of domain-specific data that allows the discovery of relevant, useful agents while maintaining reduced communication costs. Agents employ a Bayesian inference model to control an otherwise random search, such that at each step a decision procedure determines whether it is worth searching further. In this way it attempts to capture something akin to the human disposition to give up after trying a certain number of alternatives and take the best offer seen. We benchmark the approach against exhaustive search (to establish an upper bound on costs), random and tabu—all of which it outperforms—and against an independent industrial standard simulator—which it also outperforms. We demonstrate using synthetic data—for the purpose of exploring the resilience of the approaches to extreme workloads—and empirical data, the effectiveness of a system that can identify “good enough” solutions to satisfy holistic organisational service level objectives.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. In: ACM Computing Surveys (CSUR), vol. 36, pp. 335–371. ACM Press, New York (2004) ISSN:0360-0300
Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in p2p systems. Commun. ACM 46(2), 43–48 (2003)
Biswas, R., Thrun, S., Guibas, L.J.: A probabilistic approach to inference with limited information in sensor networks. In: IPSN 2004: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp. 269–276. ACM, NY (2004)
Bolstad, W.M.: Introduction to Bayesian Statistics. Wiley, Chichester (2007) ISBN-978-0-470-14115-1
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6), 2508–2530 (2006)
Czajkowski, K., Foster, I., Karonis, N., Kesselman, C., Martin, S., Smith, W., Tuecke, S.: A resource management architecture for metacomputing systems. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol. 1459, pp. 62–82. Springer, Heidelberg (1998)
Devroye, L.: Non-uniform random variate generation (1986)
Ferreira, R.A., Ramanathan, M.K., Awan, A., Grama, A., Jagannathan, S.: Search with probabilistic guarantees in unstructured peer-to-peer networks. In: P2P 2005: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 165–172. IEEE Computer Society, Washington, DC, USA (2005)
Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: a tutorial and literature review. In: Manufacturing And Service Operations Management, pp. 79–141. MSOM (2003)
Helsinger, A., Thome, M., Wright, T.: Cougaar: a scalable, distributed multi-agent architecture. In: IEEE International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1910–1917. IEEE, Los Alamitos (2004), ISSN: 1062-922X. ISBN: 0-7803-8566-7. INSPEC Accession Number: 8393468. Digital Object Identifier: 10.1109/ICSMC.2004.1399959.
Holland, J.H.: Hidden Order: How Adaptation Builds Complexity. The Perseus Books Group, Cambridge (1995) ISBN-13: 9780201407938
Kuokka, D., Harada, L.: Matchmaking for information agents. In: IJCAI 1995: Proceedings of the 14th International Joint conference on Artificial Intelligence, pp. 672–678. Morgan Kaufmann Publishers Inc., San Francisco (1995)
Lilja, D.J.: Measuring computer performance: a practitioner’s guide. Cambridge University Press, New York (2000)
Meshkova, E., Riihijärvi, J., Petrova, M., Mähönen, P.: A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks 52(11), 2097–2128 (2008)
Ogston, E., Vassiliadis, S.: Local distributed agent matchmaking. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 67–79. Springer, Heidelberg (2001)
Simonton, E., Choi, B.K., Seidel, S.: Using gossip for dynamic resource discovery. In: ICPP 2006: Proceedings of the 2006 International Conference on Parallel Processing, pp. 319–328. IEEE Computer Society, Washington, DC, USA (2006)
Stann, F., Heidemann, J.: Bard: Bayesian-assisted resource discovery in sensor networks. Technical report, USC/Information Sciences Institute (July 2004)
Sycara, K., Lu, J., Klusch, M., Widoff, S.: Matchmaking among heterogeneous agents on the internet. In: AAAI Spring Symposium on Intelligent Agents in Cyberspace (1999)
Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: Proceedings of Third International Conference on Peer-to-Peer Computing (P2P 2003), pp. 102–109 (2003)
Veit, D., Weinhardt, C., Müller, J.P.: Multi-dimensional matchmaking for electronic markets. Applied Artificial Intelligence 16(9-10), 853–869 (2002)
Vulkan, N., Jennings, N.R.: Efficient mechanisms for the supply of services in multi-agent environments. Decis. Support Syst. 28(1-2), 5–19 (2000)
Weiss, G.: Multiagent Systems. The MIT Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Traskas, D., Padget, J., Tansley, J. (2011). A Probabilistic Mechanism for Agent Discovery and Pairing Using Domain-Specific Data. In: De Vos, M., Fornara, N., Pitt, J.V., Vouros, G. (eds) Coordination, Organizations, Institutions, and Norms in Agent Systems VI. COIN 2010. Lecture Notes in Computer Science(), vol 6541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21268-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-21268-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21267-3
Online ISBN: 978-3-642-21268-0
eBook Packages: Computer ScienceComputer Science (R0)