The problem of finding the optimal coalition structure arises frequently in multiagent systems. Heuristic approaches for solving this problem are needed because of its computational complexity. This paper studies two such approaches: tabu search and simulated annealing. Through simulations we show that tabu search generates better quality solutions than simulated annealing for coalition games in characteristic function form and those in partition function form.
Published inEuropean conference on multi agent systems EUMAS 2016
CitationHUSSIN, A. and FATIMA, S., 2017. Heuristic methods for optimal
coalition structure generation. IN: Criado Pacheco, N. ... et al (eds). Multi-Agent Systems and Agreement Technologies. EUMAS 2016, AT 2016. Lecture Notes in Computer Science, vol 10207. Cham: Springer, pp.124-139.
VersionAM (Accepted Manuscript)
Publisher statementThis work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/
NotesThis is a pre-copyedited version of a contribution published in Criado Pacheco, N. ... et al (eds). Multi-Agent Systems and Agreement Technologies published by Springer. The definitive authenticated version is available online via https://doi.org/10.1007/978-3-319-59294-7_11. This paper was also presented at the European Conference on Multi-Agent Systems (EUMAS) and the Fourth International Conference on Agreement Technologies (AT), Valencia, Spain, 15th-16th December 2016.
Book seriesLecture Notes in Artificial Intelligence; 10207