Authors: Chattrakul Sombattheera
Addresses: Faculty of Informatics, Mahasarakham University, Khamreang, Kantarawichai, Mahasarakham, 44150, Thailand
Abstract: We study computing optimal coalition structures in non-linear logistics domains, where coalition values are not known a priori and computing them is NP-hard. In our setting, the common goal of the agents is to minimise the system|s cost. Agents perform two steps: 1) deliberate appropriate coalitions; 2) exchange computed coalitions and generate coalition structures. We apply the concept of best coalition introduced in Sombattheera and Ghose (2008), to work in the non-linear logistics domains. We provide an algorithm and explain via examples to show how it works. Lastly, we show the empirical results of our algorithm in terms of elapsed time and number of coalition structures generated.
Keywords: optimal coalition structure; OCS; coalition formation; game theory; multi-agent systems; MAS; agent-based systems; nonlinear logistics; supply chains; supply chain management; SCM.
International Journal of Intelligent Information and Database Systems, 2011 Vol.5 No.6, pp.555 - 578
Available online: 17 Oct 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article