Constant factor approximation algorithms for coalition structure generation

Autonomous Agents and Multi-Agent Systems

Volumn 23, Issue 1, 2011, Pages 1-17

  Service, Travis C ^a   Adams, Julie A ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Characteristic function games; Coalition structure generation

Indexed keywords

ANYTIME ALGORITHM; CENTRAL PROBLEMS; CHARACTERISTIC FUNCTIONS; COALITION STRUCTURE; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; HIGH-QUALITY SOLUTIONS; OPTIMAL SOLUTIONS; PREMATURE TERMINATION; RUNTIMES; TIME ALGORITHMS; TIME COMPLEXITY; TIME CONSTANTS; WORST CASE;

DESIGN; HEURISTIC ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 79953301014     PISSN: 13872532     EISSN: 15737454     Source Type: Journal    
DOI: 10.1007/s10458-010-9124-7     Document Type: Article

References (14)

1. Abdallah, S., & Lesser, V. (2004). Organization-based cooperative coalition formation. In Proceedings of the IEEE/WIC/ACM international conference on intelligent agent techonology, IAT, pp. 162-168.
2. Dang, V., & Jennings, N. (2004). Generating coalition structures with finite bound from the optimal guarantees. In Proceedings of the third international joint conference on autonomous agents and multiagent systems, pp. 564-571.
3. Larson K., Sandholm T. (2000) Anytime coalition structure generation: an average case study. Journal of Experimental and Theoretical AI 12: 40-47.
4. Ohta, N., Conitzer, V., Ichimura, R., Sakurai, Y., Iwasaki, A., & Yokoo, M. (2009). Coalition structure generation utilizing compact characteristic function representations. In Fifteenth international conference on principles and practice of constraint programming (CP-09), pp. 623-638.
5. Rahwan, T., & Jennings, N. (2008). Coalition structure generation: dynamic programming meets anytime optimisation. In Proceedings of the 23rd conference on AI (AAAI), pp. 156-161.
6. Rahwan, T., & Jennings, N. (2008). An improved dyanmic programming algorithm for coalition structure generation. In Proceedings of the 7th international conference on autonomous agents and multi-agent systems.
7. Rahwan, T., Ramchurn, S., Dang, V., Giovannucci, A., & Jennings, N. (2007). Anytime optimal coalition structure generation. In Proceedings of the 22nd conference on artificial intelligence (AAAI), pp. 1184-1190.
8. Rahwan, T., Ramchurn, S., Dang, V., & Jennings, N. (2007). Near-optimal anytime coalition structure generation. In Proceedings of the 20th international joint conference on artificial intelligence (IJCAI), pp. 2365-2371.
9. Rahwan T., Ramchurn S., Jennings N., Giovannucci A. (2009) An anytime algorithm for optimal coalition structure generation. Journal of Artificial Intelligence Research 34: 521-567.
10. Rothkopf M., Pekec A., Harstad R. (1998) Computationally manageable combinational auctions. Management Science 44(8): 1131-1147.
11. Sandholm T., Larson K., Anderson M., Shehory O., Tohmé F. (1999) Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1-2): 209-238.
12. Shehory O., Kraus S. (1998) Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2): 165-200.
13. Tosić P., Agha G. (2005) Maximal clique based distributed coalition formation for task allocation in large-scale multi-agent systems. Massively Multi-Agent Systems I 3446: 104-120.
14. Yeh Y. (1986) A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4): 467-474.