Coalition Structure Generation Utilizing Compact Characteristic Function Representations

  • Naoki Ohta
  • Vincent Conitzer
  • Ryo Ichimura
  • Yuko Sakurai
  • Atsushi Iwasaki
  • Makoto Yokoo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5732)

Abstract

This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coalitions is a major research challenge in AI and multi-agent systems. CSG involves partitioning a set of agents into coalitions so that social surplus is maximized. Traditionally, the input of the CSG problem is a black-box function called a characteristic function, which takes a coalition as an input and returns the value of the coalition. As a result, applying constraint optimization techniques to this problem has been infeasible. However, characteristic functions that appear in practice often can be represented concisely by a set of rules, rather than a single black-box function. Then, we can solve the CSG problem more efficiently by applying constraint optimization techniques to the compact representation directly.

We present new formalizations of the CSG problem by utilizing recently developed compact representation schemes for characteristic functions. We first characterize the complexity of the CSG under these representation schemes. In this context, the complexity is driven more by the number of rules rather than by the number of agents. Furthermore, as an initial step towards developing efficient constraint optimization algorithms for solving the CSG problem, we develop mixed integer programming formulations and show that an off-the-shelf optimization package can perform reasonably well, i.e., it can solve instances with a few hundred agents, while the state-of-the-art algorithm (which does not make use of compact representations) can solve instances with up to 27 agents.

Keywords

Multiagent systems coalition structure generation constraint optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachrach, Y., Rosenschein, J.S.: Coalitional skill games. In: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems (AAMAS), pp. 1023–1030 (2008)Google Scholar
  2. Conitzer, V., Sandholm, T.: Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), pp. 219–225 (2004)Google Scholar
  3. Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170(6), 607–619 (2006)MathSciNetCrossRefMATHGoogle Scholar
  4. Dang, V.D., Dash, R.K., Rogers, A., Jennings, N.R.: Overlapping coalition formation for efficient data fusion in multi-sensor networks. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 635–640 (2006)Google Scholar
  5. Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI), pp. 22–29 (2000)Google Scholar
  6. Håstad, J.: Clique is hard to approximate within n 1 − ε. Acta Mathematica 182, 105–142 (1999)MathSciNetCrossRefGoogle Scholar
  7. Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Proceedings of the 6th ACM Conference on Electronic Commerce (ACM EC), pp. 193–202 (2005)Google Scholar
  8. Rahwan, T., Jennings, N.R.: Coalition structure generation: dynamic programming meets anytime optimisation. In: Proceedings of the 23rd Conference on Artificial Intelligence (AAAI), pp. 156–161 (2008)Google Scholar
  9. Rahwan, T., Jennings, N.R.: An improved dynamic programming algorithm for coalition structure generation. In: Proceedings of the 7th International joint Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1417–1420 (2008)Google Scholar
  10. Rahwan, T., Ramchurn, S.D., Dang, V.D., Giovannucci, A., Jennings, N.R.: Anytime optimal coalition structure generation. In: Proceedings of the 22nd Conference on Artificial Intelligence (AAAI), pp. 1184–1190 (2007)Google Scholar
  11. Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)CrossRefMATHGoogle Scholar
  12. Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1–54 (2002)MathSciNetCrossRefMATHGoogle Scholar
  13. Sandholm, T., Lesser, V.R.: Coalitions among computationally bounded agents. Artificial Intelligence 94(1-2), 99–137 (1997)MathSciNetCrossRefMATHGoogle Scholar
  14. Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1-2), 209–238 (1999)MathSciNetCrossRefMATHGoogle Scholar
  15. Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2), 165–200 (1998)MathSciNetCrossRefMATHGoogle Scholar
  16. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)MATHGoogle Scholar
  17. Wooldridge, M., Dunne, P.E.: On the computational complexity of qualitative coalitional games. Artificial Intelligence 158(1), 27–73 (2004)MathSciNetCrossRefMATHGoogle Scholar
  18. Wooldridge, M., Dunne, P.E.: On the computational complexity of coalitional resource games. Artificial Intelligence 170(10), 835–871 (2006)MathSciNetCrossRefMATHGoogle Scholar
  19. Yeh, D.Y.: A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4), 467–474 (1986)MathSciNetCrossRefMATHGoogle Scholar
  20. Yokoo, M., Conitzer, V., Sandholm, T., Ohta, N., Iwasaki, A.: Coalitional games in open anonymous environments. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pp. 509–515 (2005)Google Scholar
  21. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 103–128 (2007)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Naoki Ohta
    • 1
  • Vincent Conitzer
    • 2
  • Ryo Ichimura
    • 1
  • Yuko Sakurai
    • 1
  • Atsushi Iwasaki
    • 1
  • Makoto Yokoo
    • 1
  1. 1.Department of ISEEKyushu UniversityFukuokaJapan
  2. 2.Department of Computer ScienceDuke UniversityDurhamUSA

Personalised recommendations