Marginal contribution nets: A compact representation scheme for coalitional games

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2005, Pages 193-202

  Ieong, Samuel ^a   Shoham, Yoav ^a  

^a Stanford University   (United States)

Author keywords

Coalitional game theory; Representation; Treewidth

Indexed keywords

COALITION GAME THEORY; REPRESENTATION; TREEWIDTH;

ALGORITHMS; GRAPH THEORY; TREES (MATHEMATICS);

GAME THEORY;

EID: 30044441223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064009.1064030     Document Type: Conference Paper

References (12)

1. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proc. 22nd Symp. on Mathematical Foundation of Copmuter Science, pages 19-36. Springer-Verlag LNCS 1295, 1997.
2. V. Conitzer and T. Sandholm. Complexity of determining nonemptiness of the core. In Proc. 18th Int. Joint Conf. on Artificial Intelligence, pages 613-618, 2003.
3. V. Conitzer and T. Sandholm. Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In Proc. 19th Nat. Conf. on Artificial Intelligence, pages 219-225, 2004.
4. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Math. Oper. Res., 19:257-266, May 1994.
5. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proc. 16th Int. Joint Conf. on Artificial Intelligence, pages 548-553, 1999.
6. M. Kearns, M. L. Littman, and S. Singh. Graphical models for game theory. In Proc. 17th Conf. on Uncertainty in Artificial Intelligence, pages 253-260, 2001.
7. J. Kleinberg, C. H. Papadimitriou, and P. Raghavan. On the value of private information. In Proc. 8th Conf. on Theoretical Aspects of Rationality and Knowledge, pages 249-257, 2001.
8. C. Li and K. Sycara. Algoirthms for combinatorial coalition formation and payoff division in an electronic marketplace. Technical report, Robotics Insititute, Carnegie Mellon University, November 2001.
9. A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, New York, 1995.
10. N. Nisan. Bidding and allocation in combinatorial auctions. In Proc. 2nd ACM Conf. on Electronic Commerce, pages 1-12, 2000.
11. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, Cambridge, Massachusetts, 1994.
12. I. Wegener. The Complexity of Boolean Functions. John Wiley & Sons, New York, October 1987.