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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sombattheera, C., Ghose, A.: A best-first anytime algorithm for computing optimal coalition structures. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1425–1428. ACM Press, New York (2008)
Shehory, O., Kraus, S.: Feasible formation of coalitions among autonomous agents in non-super-additive environments. Computational Intelligence 15(3), 218–251 (1999)
Rahwan, T., Ramchurn, S., Dang, V., Giovannucci, A., Jennings, N.: Anytime optimal coalition structure generation. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), Vancouver, Canada, pp. 1184–1190. AAAI Press, Menlo Park (2007)
Rahwan, T., Jennings, N.: Distributing coalitional value calculations among cooperating agents. In: Proceedings of the 25th National Conference on Artificial Intelligence (AAAI 2005), Pittsburgh, USA, pp. 152–157. AAAI Press, Menlo Park (2005)
Kraus, S., Shehory, O., Taase, G.: The advantages of compromising in coalition formation with incomplete information. In: Proceedings of the 3rd International Joint Conference on Autonomous Agent and Multi Agent Systems (AAMAS 2004), Washington DC, USA, pp. 588–595. IEEE Computer Society, Los Alamitos (2005)
Sandholm, T., Lesser, V.: Coalition formation among bounded rational agents. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), Montreal, Canada, pp. 662–669. Kaufman Morgan, San Francisco (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sombattheera, C. (2010). An Algorithm for Computing Optimal Coalition Structures in Non-linear Logistics Domains. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12101-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12100-5
Online ISBN: 978-3-642-12101-2
eBook Packages: Computer ScienceComputer Science (R0)