This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cooperative Game Theory: Basic Concepts and Computational Challenges
May-June 2012 (vol. 27 no. 3)
pp. 86-90
Georgios Chalkiadakis, Technical University of Crete
Edith Elkind, Nanyang Technological University
Michael Wooldridge, University of Oxford
Cooperative game theory studies situations in which agents can benefit by working together. This article outlines the key concepts of cooperative game theory, and discusess the challenges that arise in applying these in AI applications.

1. X. Deng and C. Papadimitriou, “On the Complexity of Cooperative Solution Concepts,” Mathematics of Operations Research, vol. 19, no. 2, 1994, pp. 257–266.
2. S. Ieong and Y. Shoham, “Marginal Contribution Nets: A Compact Representation Scheme for Coalitional Games,” Proc. 6th ACM Conf. Electronic Commerce (ACM-EC 05), ACM, 2005, pp. 193–202.
3. E. Elkind et al., “On the Computational Complexity of Weighted Voting Games,” Annals Mathematics and Artificial Intelligence, vol. 56, no. 2, 2009, pp. 109–131.
4. M. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
5. G. Chalkiadakis, E. Elkind, and M. Wooldridge, Computational Aspects of Cooperative Game Theory, Morgan & Claypool, 2011.

Index Terms:
cooperative game theory, core, Shapley value, complexity
Citation:
Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge, "Cooperative Game Theory: Basic Concepts and Computational Challenges," IEEE Intelligent Systems, vol. 27, no. 3, pp. 86-90, May-June 2012, doi:10.1109/MIS.2012.47
Usage of this product signifies your acceptance of the Terms of Use.