Complexity of coalition structure generation

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 1, Issue , 2011, Pages 177-184

  Aziz, Haris ^a   De Keijzer, Bart ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b CWI   (Netherlands)

Author keywords

And computational complexity; Coalition formation; Coordination; Game theory (cooperative and non cooperative); Teamwork

Indexed keywords

APPROXIMATION ALGORITHMS; AUTONOMOUS AGENTS; COMPUTER APPLICATIONS; COMPUTER GAMES; HUMAN RESOURCE MANAGEMENT; MULTI AGENT SYSTEMS; POLYNOMIALS;

ANALYSIS OF ALGORITHMS; COALITION FORMATIONS; COORDINATION; DISTRIBUTED ARTIFICIAL INTELLIGENCE; NON-COOPERATIVE; POLYNOMIAL-TIME ALGORITHMS; SOCIAL AND BEHAVIORAL SCIENCE; TEAMWORK;

PROBLEM SOLVING;

EID: 84899418864     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. S. Arora and B. Barak. Computational Complexity. Cambridge University Press, 2009.
2. H. Aziz. Complexity of comparison of influence of players in simple games. In Proceedings of the Second International Workshop on Computational Social Choice (COMSOC 2008), pages 61-72, 2008.
3. H. Aziz, O. Lachish, M. Paterson, and R. Savani. Wiretapping a hidden network. In Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), pages 438-446, 2009.
4. H. Aziz, F. Brandt, and P. Harrenstein. Monotone cooperative games and their threshold versions. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AA- MAS), pages 1017-1024, 2010.
5. Y. Bachrach and J. S. Rosenschein. Coalitional skill games. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 1023-1030, 2008.
6. Y. Bachrach and J. S. Rosenschein. Power in threshold network flow games. Journal of Autonomous Agents and Multi-Agent Systems, 18(1):106-132, 2009.
7. Y. Bachrach, R. Meir, K. Jung, and P. Kohli. Coalitional structure generation in skill games. In M. Fox and D. Poole, editors, Proceedings of the 24th AAA/Conference on Artificial Intelligence (AAAI). AAAI Press, 2010.
8. V. Conitzer and T. Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence, 170:607-619, 2006.
9. X. Deng and Q. Fang. Algorithmic cooperative game theory. In A. Chinchuluun, P. M. Pardalos, A. Migdalas, and L. Pitsoulis, editors, Pareto Opti- mality, Game Theory And Equilibria, volume 17 of Springer Optimization and Its Applications, pages 159- 185. Springer, 2008.
10. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 12(2):257-266, 1994.
11. E. Elkind, L. A. Goldberg, P. W. Goldberg, and M. J. Wooldridge. Computational complexity of weighted threshold games. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI), pages 718- 723. AAAI Press, 2007.
12. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, Berlin, Germany, 2004.
13. W. Kern and D. Paulusma. Matching games: the least core and the nucleolus. Mathematics of Operations Research, 28(2):294-308, 2003.
14. F. Maffioli and G. Galbiati. Approximability of hard combinatorial optimization problems: An introduction. Annals of Operations Research, 96(1):221-236, 11 2000.
15. T. Matsui and Y. Matsui. A survey of algorithms for calculating power indices of weighted majority games. Journal of the Operations Research Society of Japan, 43 (1):71-86, 2000.
16. T. Michalak, J. Sroka, T. Rahwan, M. Wooldridge, P. Mcburney, and N. Jennings. A distributed algorithm for anytime coalition structure generation. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2010.
17. N. Ohta, V. Conitzer, R. Ichimura, Y. Sakurai, A. Iwasaki, and M. Yokoo. Coalition structure generation utilizing compact characteristic function representations. In 15th International Conference on the Principles and Practice of Constraint Programming (CP), pages 623-638, 2009.
18. T. Rahwan, S. Ramchurn, N. Jennings, and A. Gio-vannucci. An anytime algorithm for optimal coalition structure generation. Journal of Artificial Intelligence Research (JAIR), 34:521-567, 2009.
19. J. Roskind and R. E. Tarjan. A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees. Mathematics of Operations Research, 10(4):701-708, 1985.
20. T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohme. Coalition structure generation with worst case guarantees. Artificial Intelligence, 111(1-2): 209-238, 1999.
21. T. Service and J. Adams. Approximate Coalition Structure Generation. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 2010.
22. T. Shrot, Y. Aumann, and S. Kraus. On agent types in coalition formation problems. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2010.
23. A. D. Taylor and W. S. Zwicker. Simple Games. Princeton University Press, 1999.
24. A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 222-227, Washington, DC, USA, 1977. IEEE Computer Society.