Marginal contribution nets: a compact representation scheme for coalitional games
暂无分享,去创建一个
[1] C. Papadimitriou,et al. On the value of private information , 2001 .
[2] Vincent Conitzer,et al. Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains , 2004, AAAI.
[3] Katia P. Sycara,et al. Algorithm for combinatorial coalition formation and payoff division in an electronic marketplace , 2002, AAMAS '02.
[4] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[5] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[6] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..
[7] H. L. Bodlaender,et al. Treewidth: Algorithmic results and techniques , 1997 .
[8] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[9] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[10] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[11] Vincent Conitzer,et al. Complexity of determining nonemptiness of the core , 2003, EC '03.
[12] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[13] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .