Advertisement

Coalition Structure Generation in Task-Based Settings Based on Cardinality Structure

  • She-Xiong Su
  • Shan-Li Hu
  • Sheng-Fu Zheng
  • Chao-Feng Lin
  • Xian-Wei Lai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5044)

Abstract

Coalition formation is a key topic in multi-agent systems. To date, most work on this problem has concentrated on simple characteristic function games. However, this lacks the notion of tasks which makes it more difficult to apply it in many applications. Dang et showed that this problem was NP-hard and that the minimum number of coalition structures that need to be searched through in order to establish a solution within a bound from the optimal was (2\(^{m+{\it n}-1}\)-1). Then Dang et presented an algorithm that takes a step further to search those task-based coalition structures whose biggest task-based coalition’s cardinality is greater than or equal to ⌈n(k − 1)/(k + 1)⌉ in order to attain the bound K, which is the best result known so far. Against this background, this paper reports on a novel anytime algorithm based on cardinality structure that only have to take a step further to search those task-based coalition structures whose cardinality structure is in the CTCS(n, m, K *). Finally via contrast experiment, the algorithm reported in this paper is obviously better than that of Dang et al. (up to 1019 times faster when n=60,m=40, K=3).

Keywords

Multiagent system coalition structure task cardinality structure 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rahwan, T., Ramchurn, S.D., Dang, V.D., Jennings, N.R.: Near-Optimal Anytime Coalition Structure Generation. In: 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, pp. 2365–2371 (2007)Google Scholar
  2. 2.
    Su, S.-X., Hu, S.-L.: Coalition Structure Generation with Worst Case Guarantees based on Cardinality Structure. In: 6th International Joint Conference on Autonomous Agents and Multi-Agent Systems, Hawai´i, USA, pp. 1182–1184 (2007)Google Scholar
  3. 3.
    Su, S.-X., Hu, S.-L., Lin, C.-F., Zheng, S.-F.: A Coalition Generation Algorithm Based On Local Optimum. Chinese Journal of Computer Research & Development 44, 277–282 (2007)CrossRefGoogle Scholar
  4. 4.
    Su, S.-X., Hu, S.-L., Zheng, S.-F., Lin, C.-F., Lai, X.-W.: Coalition Structure Generation With Given Required Bound Based on Cardinality Structure. In: 6th International Conference on Machine Learning and Cybernetics, Hong Kong, China, pp. 2505–2510 (2007)Google Scholar
  5. 5.
    Dang, V.D., Jennings, N.R.: Coalition structure generation in task-based settings. In: 17th European Conference on AI, Trento, Italy, pp. 210–214 (2006)Google Scholar
  6. 6.
    Li, C., Sycara, K.: A stable and efficient scheme for task allocation via agent coalition formation. Algorithms for Cooperative Systems. World Scientific, Singapore (2004)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • She-Xiong Su
    • 1
  • Shan-Li Hu
    • 1
    • 2
  • Sheng-Fu Zheng
    • 1
  • Chao-Feng Lin
    • 1
  • Xian-Wei Lai
    • 1
  1. 1.Department of Computer Science and TechnologyFuzhou UniversityFuzhouChina
  2. 2.Key Laboratory for Computer ScienceThe Chinese Academy of SciencesBeijingChina

Personalised recommendations