Heuristic methods for optimal coalition structure generation

• Main Authors: Amir Hussin, Amir 'Aatieff, Fatima, Shaheen S.
• Format: Conference or Workshop Item
• Language: English; English
• Published: Springer Verlag 2017
• Subjects: QA297 Numerical Analysis; QA75 Electronic computers. Computer science; QA76 Computer software
• Online Access: http://irep.iium.edu.my/79124/1/79124_Heuristic%20methods%20for%20optimal%20coalition%20structure%20generation_pdf.pdf; http://irep.iium.edu.my/79124/2/79124_Heuristic%20methods%20for%20optimal%20coalition%20structure%20generation_SCOPUS.pdf; http://irep.iium.edu.my/79124/; https://repository.lboro.ac.uk/articles/conference%20contribution/Heuristic_methods_for_optimal_coalition_structure_generation/9404543/1

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.