Computing optimal coalition structures in non-linear logistics domains. (1st January 2011)

• Record Type: Journal Article
• Authors: Sombattheera, Chattrakul
• Is Part Of: International journal of intelligent information and database systems. Volume 5:Number 6(2011)
• Page Start: 555
• Page End: 578
• Publication Date: 2011-01-01
• Subjects: optimal coalition structure -- OCS -- coalition formation -- game theory -- multi-agent systems -- logistics -- supply chains; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

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.