Anytime optimal coalition structure generation

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1184-1190

  Rahwan, Talal ^a   Ramchurn, Sarvapali D ^a   Dang, Viet D ^c   Giovannucci, Andrea ^b   Jennings, Nicholas R ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^c Lost Wax Media Ltd   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING;

COALITION STRUCTURE GENERATION; REASONABLE TIME;

AUTONOMOUS AGENTS;

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

References (8)

1. Dang, V. D., and Jennings, N. R. 2004. Generating coalition structures with finite bound from the optimal guarantees. In AAMAS, 564-571.
2. Larson, K., and Sandholm, T. 2000. Anytime coalition structure generation: an average case study. J. Exp. and Theor. Artif. Intell. 12(1):23-42.
3. Rahwan, T.; Ramchurn, S. D.; Dang, V. D.; and Jennings, N. R. 2007. Near-optimal anytime coalition structure generation. In IJCAI, 2365-2371.
4. Rothkopf, M. H.; Pekec, A.; and Harstad, R. M. 1998. Computationally manageable combinatorial auctions. Management Science 44(8): 1131-1147.
5. Sandholm, T.; Larson, K.; Andersson, M.; Shehory, O.; and Tohmé, F. 1999. Coalition structure generation with worst case guarantees. Artif. Intelligence 111(1-2):209-238.
6. Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artif. Intelligence 101(1-2): 165-200.
7. Skiena, S. S. 1998. The Algorithm Design Manual. Springer.
8. Yun Yeh, D. 1986. A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4):467-474.