Abstract
In this paper, the coalition formation problem is studied in an open environment where agents can arrive dynamically, i.e. the set of agents is not given in advance. In order to maximize the gross income of MAS (Multi-Agent System), task allocator may incline to discard some coalition members, and then introduce some new ones when new agents arrive; we call such problem coalition restructuring. To address this problem, we introduce a novel description of the coalition formation problem which takes time into account, and then formally present the coalition restructuring problem. What’s more, we study different kinds of measures which agents and task allocator will take because of new agents’ arriving. Finally, we develop an anytime coalition restructuring algorithm, which is proved effective and available by the simulation. An example is also designed to make it easy to understand our algorithm.
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.
Similar content being viewed by others
References
Chalkiadakis, G., Boutilier, C.: Bayesian Reinforcement Learning for Coalition Formation under Uncertainty. In: Proceedings of 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, New York, USA, pp. 1090–1097 (2004)
Lin, C., Hu, S.: Multi-task Coalition Generation Algorithm Based on an Improved Ant Colony Algorithm. Journal of Computer Research & Development 43(Suppl.), 176–181 (2006)
Lin, C., Hu, S.: Multi-task Overlapping Coalition Parallel Formation Algorithm. In: Proceedings of 6th International Joint Conference on Autonomous Agents and Multiagent Systems, Honolulu, Hawai’I (2007)
Conitzer, V., Sandholm, T.: Complexity of Constructing Solutions in the Core Based on Synergies Among Coalitions. Artificial Intelligence 170(6-7), 607–619 (2006)
Kraus, S., Shehory, O., Taase, G.: Coalition formation with uncertain heterogeneous information. In: Proceedings of 2nd International Joint Conference on Autonomous Agents and Multiagent Systems, Melbourne, Australia, pp. 1–8 (2003)
Kraus, S., Shehory, O., Taase, G.: The Advantages of Compromising in Coalition Formation with Incomplete Information. In: Proceedings of 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, New York, USA, pp. 588–595 (2004)
Makoto, Y., Conitzer, V., Sandholm, T., Naoki, O., Atsushi, I.: Coalitional Games in Open Anonymous Environments. In: Proceedings of 20th National Conference on Artificial Intelligence, Pittsburgh, Pennsylvania, pp. 509–515 (2005)
Manisterski, E., David, E., Kraus, S., Jennings, N.R.: Forming Efficient Agent Groups for Completing Complex Tasks. In: Proceedings of 5th International Joint Conference on Autonomous Agents and Multiagent Systems, Hakodate, Japan, pp. 834–841 (2006)
Naoki, O., Atsushi, I., Makoto, Y., Kohki, M., Conitzer, V., Sandholm, T.: A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. In: Proceedings of 21st National Conference on Artificial Intelligence, Boston, Massachusetts (2006)
Rahwan, T., Ramchurn, S.D., Dang, V.D., Jennings, N.R.: Near-optimal Anytime Coalition Structure Generation, In: Proceedings of 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, pp. 2365–2371 (2007)
Sarne, D., Hadad, M., Kraus, S.: Auction Equilibrium Strategies for Task Allocation in Uncertain Environments. In: Proceedings of 8th International Workshop on Cooperative Information Agents, Erfurt, Germany, pp. 271–285 (2004)
Sarne, D., Kraus, S.: Solving the Auction-Based Task Allocation Problem in an Open Environment. In: Proceedings of 20th National Conference on Artificial Intelligence, Pittsburgh, Pennsylvania, pp. 164–169 (2005)
Su, S., Hu, S., Shi, C.: Coalition Structure Generation with Worst Case Guarantees based on Cardinality Structure. In: Proceedings of 6th International Joint Conference on Autonomous Agents and Multiagent Systems, Honolulu, Hawai’I (2007)
Wooldridge, M., Dunne, P.E.: On the Computational Complexity of Coalitional Resource Games. Artificial Intelligence 170(10), 835–871 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lin, CF., Hu, SL., Lai, XW., Zheng, SF., Su, SX. (2007). An Anytime Coalition Restructuring Algorithm in an Open Environment. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)