Abstract
A matching is a (one-to-one) mapping between two sets, satisfying some given constraints. In a multiagent scenario, i.e. in a setting where at least one of the sets corresponds to a group of agents, a number of interesting facets are added to this general matching problem. Therefore, in this paper, we discuss several different matching criteria, where preference between elements is based on their distance (not on rankings), and state their relationship to well-known criteria, e.g. Pareto efficiency. We also introduce algorithms for computing matchings. The first one (|LocalMatch|), a decentralized algorithm, requires only communication between pairs of agents. The second algorithm (|GlobalMatch|) with a central control agent, called coach, computes a globally maximal matching, i.e., where the maximal distance in the matching is minimized not only for the whole set of elements, but also for each submatching, in O(n 2.5log n) time. Especially this kind of matching has applications in multiagent systems for solving transportation problems, coordination of rescue robots, and marking in (simulated) robotic soccer, which is addressed in this paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM Journal on Computing 29(3), 912–953 (1995)
Chen, M., Dorer, K., Foroughi, E., Heintz, F., Huang, Z., Kapetanakis, S., Kostiadis, K., Kummeneje, J., Murray, J., Noda, I., Obst, O., Riley, P., Steffens, T., Wang, Y., Yin, X.: RoboCup Soccer Server, Manual for Soccer Server Version 7.07 and later (obtainable from sserver.sf.net) (2003)
Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica 31, 1–28 (2001)
Gale, D., Shapely, L.: College admissions and the stability of marriage. American Mathematical Monthly (1962)
Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the optimal stable marriage. Journal of the ACM 34(3), 532–543 (1987)
Murray, J., Obst, O., Stolzenburg, F.: RoboLog Koblenz 2001. In: Birk, A., Coradeschi, S., Tadokoro, S. (eds.) RoboCup 2001. LNCS (LNAI), vol. 2377, p. 526. Springer, Heidelberg (2002) (Team description)
Official homepage of the RoboCup Federation, http://www.robocup.org/
Sandholm, T.W.: Distributed rational decision making. In: Weiss, G. (ed.) Multiagent Systems. A Modern Approach to Distributed Artificial Intelligence, ch. 5, pp. 201–258. MIT Press, Cambridge (1999)
Sturm, K.: Der RoboLog-Coach – Ein Online-Coach für Fußballmannschaften der Simulationsliga der RoboCup-Initiative. Diplomarbeit D 690, Fachbereich Informatik, Universität Koblenz-Landau (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stolzenburg, F., Murray, J., Sturm, K. (2003). Multiagent Matching Algorithms with and without Coach. In: Schillo, M., Klusch, M., Müller, J., Tianfield, H. (eds) Multiagent System Technologies. MATES 2003. Lecture Notes in Computer Science(), vol 2831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39869-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39869-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20124-3
Online ISBN: 978-3-540-39869-1
eBook Packages: Springer Book Archive