Abstract
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The presented contraction algorithm is based on incrementally refined acquaintance models (IRAM) of the actor that provide the right set of approximate knowledge needed for appropriate task decomposition and delegation. This paper reports on empirical evaluation of the IRAM algorithm deployment in consortia formation domain.
This is a preview of subscription content, log in via an institution to check access.
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
Pěchouček, M., Mařík, V., Bárta, J.: Role of acquaintance models in agent’s private and semi-knowledge disclosure. Knowledge-Based Systems 19, 259–271 (2006)
Pěchouček, M., Lerch, O., Bíba, J.: Iterative query-based approach to efficient task decomposition and resource allocation. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds.) CIA 2006. LNCS (LNAI), vol. 4149, pp. 258–272. Springer, Heidelberg (2006)
Cao, W., Bian, C.-G., Hartvigsen, G.: Achieving efficient cooperation in a multi-agent system: The twin-base modeling. In: Kandzia, P., Klusch, M. (eds.) Cooperative Information Agents. LNCS (LNAI), vol. 1202, pp. 210–221. Springer, Heidelberg, Heidelberg (1997)
Mařík, V., Pěchouček, M., Štěpánková, O.: Social knowledge in multi-agent systems. In: Luck, M., Mařík, V., Štepankova, O. (eds.) Multi-Agent Systems and Applications. LNCS (LNAI). Springer, Heidelberg (2001)
Vokřínek, J., Hodík, J., Bíba, J., Vybíhal, J., Pěchouček, M.: Competitive contract net protocol. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 656–668. Springer, Heidelberg (2007)
Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality af A*. J. ACM 32(3), 505–536 (1985)
Sandholm, T.: Distributed Rational Decision Making. In: Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pp. 201–258. MIT Press, Cambridge (1999)
Saha, S., Biswas, A., Sen, S.: Modeling opponent decision in repeated one-shot negotiations. In: AAMAS 2005: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 397–403. ACM, New York (2005)
Rivlin, T.: Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. Wiley-Interscience, Chichester (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doubek, J., Vokřínek, J., Pěchouček, M., Rehák, M. (2008). Incrementally Refined Acquaintance Model for Consortia Composition. In: Klusch, M., Pěchouček, M., Polleres, A. (eds) Cooperative Information Agents XII. CIA 2008. Lecture Notes in Computer Science(), vol 5180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85834-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-85834-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85833-1
Online ISBN: 978-3-540-85834-8
eBook Packages: Computer ScienceComputer Science (R0)