Mathematical Programming: Series A and B
Multi-Agent Coordination through Coalition Formation
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
Coalition formation with uncertain heterogeneous information
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The Advantages of Compromising in Coalition Formation with Incomplete Information
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A best-first anytime algorithm for computing optimal coalition structures
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Distributing coalitional value calculations among cooperative agents
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Anytime optimal coalition structure generation
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Coalition structure generation: dynamic programming meets anytime optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Coalition formation among bounded rational agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Coalition structure generation in multi-agent systems with positive and negative externalities
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
| Hi-index | 0.00 |
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.