A tractable and expressive class of marginal contribution nets and its applications

Mathematical Logic Quarterly

Volumn 55, Issue 4, 2009, Pages 362-376

  Elkind, Edith ^a   Goldberg, Leslie Ann ^b   Goldberg, Paul W ^b   Wooldridge, Michael ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Coalitional games; Marginal contribution networks; Read once formulas; Shapley value

Indexed keywords

EID: 70349141421     PISSN: 09425616     EISSN: 15213870     Source Type: Journal    
DOI: 10.1002/malq.200810021     Document Type: Article

References (14)

1. X. Deng and C. H. Papadimitriou, On the complexity of cooperative solution concepts. Mathematics of Operations Research 19, 257-266 (1994).
2. S. Ieong and Y. Shoham, Marginal contribution nets: A compact representation scheme for coalitional games. In: Proceedings of the Sixth ACM Conference on Electronic Commerce (EC'05), (Vancouver, Canada, 2005).
3. E. Malizia, L. Palopoli, and F. Scarbello, Infeasibility certificates and the complexity of the core in coalitional games. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), (Hyderabad, India, 2007).
4. E. Elkind and M. Wooldridge, Hedonic coalition nets. In: Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2009), (Budapest, Hungary, 2009).
5. J. Uckelman, Y. Chevaleyre, U. Endriss, and J. Lang, Representing utility functions via weighted goals. To appear in Math. Log. Quart. (2009).
6. Y. Bachrach and J. S. Rosenschein, Computing the Banzhaf power index in network flow games. In: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2007), (Honolulu, Hawaii, 2007), pp. 335-341.
7. M. J. Osborne and A. Rubinstein, A Course in Game Theory (The MIT Press, 1994).
8. J. F. Banzhaf, III, Weighted voting doesn't work: A mathematical analysis. Rutgers Law Review 19, 317-343 (1965).
9. V. Conitzer and T. Sandholm, Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains In: Proceedings of the Ninteenth National Conference on Artificial Intelligence (AAAI-2004), (San Jose, CA, 2004), pp. 219-225.
10. D. Angluin, L. Hellerstein, and M. Karpinski, Learning read-once formulas with queries. Journal of the ACM 40, 185-210 (1993).
11. E. Kalai and E. Zemel, On totally balanced games and games of flow. Discussion Paper 413, Northwestern University, Center for Mathematical Studies in Economics and Management Science (1980).
12. E. Kalai and E. Zemel, Generalized network problems yielding totally balanced games. Operations Research 30, 998 - 1008 (1982).
13. E. Elkind, L. Goldberg, P. Goldberg, and M. Wooldridge, Computational complexity of weighted threshold games. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI-2007), (Vancouver, British Columbia, Canada, 2007).
14. P. E. Dunne, S. Kraus, W. van der Hoek, and M. Wooldridge, Cooperative boolean games. In: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2008), (Estoril, Portugal, 2008).