Coalition structure generation utilizing compact characteristic function representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5732 LNCS, Issue , 2009, Pages 623-638

  Ohta, Naoki ^a   Conitzer, Vincent ^b   Ichimura, Ryo ^a   Sakurai, Yuko ^a   Iwasaki, Atsushi ^a   Yokoo, Makoto ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b Duke University   (United States)

Author keywords

Coalition structure generation; Constraint optimization; Multiagent systems

Indexed keywords

BLACK-BOX FUNCTIONS; CHARACTERISTIC FUNCTIONS; COALITION STRUCTURE; COALITION STRUCTURE GENERATION; COMPACT REPRESENTATION; CONSTRAINT OPTIMIZATION; CONSTRAINT OPTIMIZATIONS; MIXED INTEGER PROGRAMMING; OPTIMIZATION PACKAGES; REPRESENTATION SCHEMES; RESEARCH CHALLENGES; SET OF RULES; STATE-OF-THE-ART ALGORITHMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; FADING CHANNELS; INTEGER PROGRAMMING; MULTI AGENT SYSTEMS; POWDERS; SHAPE OPTIMIZATION; SIGNAL INTERFERENCE; STRUCTURAL OPTIMIZATION;

SET THEORY;

EID: 70350424426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_49     Document Type: Conference Paper

References (21)

1. Bachrach, Y., Rosenschein, J.S.: Coalitional skill games. In: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems (AA-MAS), pp. 1023-1030 (2008)
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)
3. Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170(6), 607-619 (2006)
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)
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)
6. 1-ε. Acta Mathematica 182, 105-142 (1999)
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)
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)
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)
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)
11. Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131-1147 (1998)
12. Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1-54 (2002)
13. Sandholm, T., Lesser, V.R.: Coalitions among computationally bounded agents. Artificial Intelligence 94(1-2), 99-137 (1997)
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)
15. Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2), 165-200 (1998)
16. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
17. Wooldridge, M., Dunne, P.E.: On the computational complexity of qualitative coali-tional games. Artificial Intelligence 158(1), 27-73 (2004)
18. Wooldridge, M., Dunne, P.E.: On the computational complexity of coalitional resource games. Artificial Intelligence 170(10), 835-871 (2006)
19. Yeh, D.Y.: A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4), 467-474 (1986)
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)
21. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 103-128 (2007)