Optimal coalition structure generation in cooperative graph games

Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

Volumn , Issue , 2013, Pages 81-87

  Bachrach, Yoram ^a   Kohli, Pushmeet ^a   Kolmogorov, Vladimir ^b   Zadimoghaddam, Morteza ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC GAME THEORY; BOUNDED DEGREE GRAPHS; COALITIONAL GAME; COMBINATORIAL PROBLEM; CONSTANT FACTOR APPROXIMATION; EDGE-WEIGHTED GRAPH; OPTIMAL COALITION; REPRESENTATION LANGUAGES;

ALGORITHMIC LANGUAGES; APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER GAMES; GRAPHIC METHODS;

GRAPH THEORY;

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

References (35)

1. Aumann, R., and Dreze, J. 1974. Cooperative games with coalition structures. International Journal of Game Theory 3(4):217-237.
2. Aziz, H., and de Keijzer, B. 2011. Complexity of coalition structure generation. Arxiv preprint arXiv:1101.1007.
3. Bachrach, Y., and Rosenschein, J. 2009. Power in threshold network flow games. AAMAS 18(1):106-132.
4. Bachrach, Y.; Elkind, E.; Meir, R.; Pasechnik, D.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. 2009a. The cost of stability in coalitional games. Algorithmic Game Theory 122-134.
5. Bachrach, Y.; Meir, R.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. 2009b. The cost of stability in weighted voting games. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, 1289-1290.
6. Bachrach, Y.; Meir, R.; Jung, K.; and Kohli, P. 2010. Coalitional Structure Generation in Skill Games. In AAAI-2010.
7. Bansal, N.; Blum, A.; and Chawla, S. 2004. Correlation clustering. Machine Learning Journal 86-113.
8. Bilbao, J. M. 2000. Cooperative Games on Combinatorial Structures. Kluwer Publishers.
9. Chalkiadakis, G.; Elkind, E.; and Wooldridge, M. 2011. Computational Aspects of Cooperative Game Theory. Morgan and Claypool.
10. Chalkiadakis, G.; Markakis, E.; and Jennings, N. R. 2012. Coalitional stability in structured environments. In AAMAS, 779-786.
11. Cowans, P., and Szummer, M. 2005. A graphical model for simultaneous partitioning and labeling. In AISTATS.
12. Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2):257-266.
13. Gabow, H., and Westermann, H. 1988. Forests, frames, and games: algorithms for matroid sums and applications. In Proceedings of the twentieth annual ACM symposium on Theory of computing, STOC ?88, 407-421. New York, NY, USA: ACM.
14. Gillies, D. B. 1953. Some theorems on n-person games. Ph.D. Dissertation, Princeton University.
15. Greco, G.; Malizia, E.; Palopoli, L.; and Scarcello, F. 2011. On the complexity of the core over coalition structures. In AAAI, 216-221.
16. Håstad, J. 1996. Clique is hard to approximate within n1-epsilon. In FOCS, 627-636.
17. Ieong, S., and Shoham, Y. 2006. Multi-attribute coalitional games. In ACM EC.
18. Larson, K., and Sandholm, T. 2000. Anytime coalition structure generation: average case study. J. Experimental & Theoretical Artificial Intelligence 12(1):23-42.
19. Mitra, P., and Samal, M. 2009. Approximation algorithm for correlation clustering. In Networked Digital Technologies (NDT).
20. NASH-WILLIAMS, C. S. A. 1964. Decomposition of finite graphs into forests. J. London Math. Soc.
21. Ohta, N.; Iwasaki, A.; Yokoo, M.; Maruono, K.; Conitzer, V.; and Sandholm, T. 2006. A compact representation scheme for coalitional games in open anonymous environments. In AAAI, volume 21, 697-702.
22. Peleg, B., and Sudholter, P. 2007. Introduction to the theory of cooperative games. Springer.
23. Rahwan, T., and Jennings, N. 2008. An improved dynamic programming algorithm for coalition structure generation. In AAMAS.
24. Rahwan, T.; Ramchurn, S.; Dang, V.; Giovannucci, A.; and Jennings, N. 2007. Anytime optimal coalition structure generation. In AAAI
25. Rahwan, T.; Michalak, T.; Wooldridge, M.; and Jennings, N. R. 2012. Anytime coalition structure generation in multiagent systems with positive or negative externalities. Artificial Intelligence.
26. Sandholm, T.; Larson, K.; Andersson, M.; Shehory, O.; and Tohmé, F. 1999. Coalition structure generation with worst case guarantees. AIJ.
27. Schmeidler, D. 1969. The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics 17(6):1163-1170.
28. Service, T., and Adams, J. 2010. Approximate coalition structure generation. In AAAI.
29. Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2):165-200.
30. Shoham, Y., and Leyton-Brown, K. 2009. Multiagent systems: Algorithmic, game-theoretic, and logical foundations. Cambridge Univ Pr.
31. Tan, J. 2008. A note on the inapproximability of correlation clustering. Information Processing Letters 108(5):331-335.
32. Thomason, A. 2001. The extremal function for complete minors. J. Comb. Theory Ser. B 81(2):318-338.
33. Voice, T.; Polukarov, M.; and Jennings, N. R. 2012. Graph coalition structure generation. Technical report.
34. Wagner, K. 1937. Uber eine Eigenschaft der ebenen Komplexe. Math. Ann. 114:570-590.
35. Yun Yeh, D. 1986. A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4):467-474.