Paper Info
Title
An algorithm for computing optimal coalition structures in non-linear logistics domains
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 problem. The common goal of the agents is to minimize the system's cost. Agents perform two steps: i) deliberate appropriate coalitions, and ii) exchange computed coalitions and generate coalition structures. We apply the concept of best coalition introduced in [1], to work in the non-linear logistics domain. We provide an algorithm, explain via examples to show it works. Lastly, we show the empirical results of our algorithm in terms of elapsed time and number of coalition structures generated.
Year
DOI
Venue
2010
10.1007/978-3-642-12101-2_9
ACIIDS
Keywords
Field
DocType
empirical result,exchange computed coalition,common goal,coalition value,np-hard problem,coalition structure,deliberate appropriate coalition,best coalition,optimal coalition structure,non-linear logistics domain,np hard problem
Nonlinear system,Computer science,A priori and a posteriori,Algorithm,Core (game theory)
Conference
Volume
ISSN
ISBN
5991
0302-9743
3-642-12100-5
Citations 
PageRank 
References 
0
0.34
5
Authors
1
Name
Order
Citations
PageRank
Chattrakul Sombattheera1306.87