Coalitional Structure Generation in Skill Games

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 703-708

  Bachrach, Yoram ^a   Meir, Reshef ^b   Jung, Kyomin ^c   Kohli, Pushmeet ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS; STRUCTURAL OPTIMIZATION; TREES (MATHEMATICS);

CHARACTERISTICS FUNCTIONS; COALITION STRUCTURE; COALITIONAL GAME; CONSTRAINT SATISFACTION; HARDNESS RESULT; OPTIMAL COALITION; POSITIVE SIDES; SKILL SETS; STRUCTURE GENERATION; SUCCINCT REPRESENTATION;

POLYNOMIAL APPROXIMATION;

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

References (20)

1. Aumann, R., and Dreze, J. 1974. Cooperative games with coalition structures. International Journal of Game Theory 3(4):217-237.
2. Bachrach, Y., and Rosenschein, J. S. 2007. Computing the Banzhaf power index in network flow games. In AAMAS 2007, 323-329.
3. Bachrach, Y., and Rosenschein, J. S. 2008. Coalitional skill games. In AAMAS 2008, 1023-1030.
4. Bachrach, Y.; Elkind, E.; Meir, R.; Pasechnik, D.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. S. 2009. The cost of stability in coalitional games. In SAGT 2009, 122-134.
5. Bilbao, J. M. 2000. Cooperative Games on Combinatorial Structures. Kluwer Publishers.
6. Bodlaender, H. 1993. A linear time algorithm for finding tree-decompositions of small treewidth. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, 226-234. ACM New York, NY, USA.
7. Dang, V.; Dash, R.; Rogers, A.; and Jennings, N. 2006. Overlapping coalition formation for efficient data fusion in multi-sensor networks. In AAAI-2006, volume 21, 635.
8. Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2):257-266.
9. Elkind, E.; Chalkiadakis, G.; and Jennings, N. 2008. Coalition structures in weighted voting games. In ECAI-2008, 393.
10. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.
11. Gottlob, G.; Leone, N.; and Scarcello, F. 2002. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64(3):579-627.
12. Ieong, S., and Shoham, Y. 2005. Marginal contribution nets: A compact representation scheme for coalitional games. In Proceedings of the 6th ACM Conference on Electronic Commerce, 193-202.
13. Larson, K., and Sandholm, T. 2000. Anytime coalition structure generation: average case study. J. Experimental & Theoretical Artificial Intelligence 12(1):23-42.
14. Ohta, N.; Conitzer, V.; Ichimura, R.; Sakurai, Y.; Iwasaki, A.; and Yokoo, M. 2009. Coalition Structure Generation Utilizing Compact Characteristic Function Representations. In CP-09. Springer.
15. Peleg, B., and Sudholter, P. 2007. Introduction to the theory of cooperative games. Springer.
16. Rahwan, T., and Jennings, N. 2008. An improved dynamic programming algorithm for coalition structure generation. In AAMAS-2008, 1417-1420.
17. Russell, S., and Norvig. 2003. Artificial intelligence: a modern approach. Prentice hall, Upper Saddle River, N.J.
18. Sandhlom, T., and Lesser, V. 1997. Coalitions among computationally bounded agents. Artificial Intelligence 94(1-2):99-137.
19. Sandholm, T.; Larson, K.; Andersson, M.; Shehory, O.; and Tohmé, F. 1999. Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1):209-238.
20. Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2):165-200.