An Imperfect Algorithm for Coalition Structure Generation

Authors

  • Narayan Changder National Institute of Technology Durgapur
  • Samir Aknine Claude Bernard University
  • Animesh Dutta National Institute of Technology Durgapur

DOI:

https://doi.org/10.1609/aaai.v33i01.33019923

Abstract

Optimal Coalition Structure Generation (CSG) is a significant research problem that remains difficult to solve. Given n agents, the ODP-IP algorithm (Michalak et al. 2016) achieves the current lowest worst-case time complexity of O(3n). We devise an Imperfect Dynamic Programming (ImDP) algorithm for CSG with runtime O(n2n). Imperfect algorithm means that there are some contrived inputs for which the algorithm fails to give the optimal result. Experimental results confirmed that ImDP algorithm performance is better for several data distribution, and for some it improves dramatically ODP-IP. For example, given 27 agents, with ImDP for agentbased uniform distribution time gain is 91% (i.e. 49 minutes).

AAAI-19 Proceedings Cover

Downloads

Published

2019-07-17

How to Cite

Changder, N., Aknine, S., & Dutta, A. (2019). An Imperfect Algorithm for Coalition Structure Generation. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 9923-9924. https://doi.org/10.1609/aaai.v33i01.33019923

Issue

Vol. 33 No. 01: AAAI-19, IAAI-19, EAAI-20

Section

Student Abstract Track