### Coalition structure generation in cooperative games with compact representations

暂无分享，去创建一个

Vincent Conitzer | Makoto Yokoo | Yuko Sakurai | Atsushi Iwasaki | Suguru Ueda | Naoki Ohta | M. Yokoo | Atsushi Iwasaki | Y. Sakurai | Naoki Ohta | Suguru Ueda | Vincent Conitzer

[1] Nicholas R. Jennings,et al. Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks , 2006, AAAI.

[2] Michael Wooldridge,et al. A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications , 2008, Math. Log. Q..

[3] Makoto Yokoo,et al. An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[4] Victor R. Lesser,et al. Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[5] Piotr Faliszewski,et al. Constrained Coalition Formation , 2011, AAAI.

[6] Luigi Palopoli,et al. On the complexity of core, kernel, and bargaining set , 2008, Artif. Intell..

[7] Haris Aziz,et al. Complexity of coalition structure generation , 2011, AAMAS.

[8] Enrique Francisco Castillo Ron,et al. Building and solving mathematical programming models in engineering and science , 2002 .

[9] Nicholas R. Jennings,et al. A logic-based representation for coalitional games with externalities , 2010, AAMAS.

[10] Nicholas R. Jennings,et al. Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities , 2009, IJCAI.

[11] Makoto Yokoo,et al. A Graphical Representation for Games in Partition Function Form , 2015, AAAI.

[12] Vincent Conitzer,et al. Complexity of stability-based solution concepts in multi-issue and MC-net cooperative games , 2014, AAMAS.

[13] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .

[14] Vincent Conitzer,et al. Coalition Structure Generation Utilizing Compact Characteristic Function Representations , 2011 .

[15] Luigi Palopoli,et al. On the Complexity of the Core over Coalition Structures , 2011, IJCAI.

[16] Miyuki Koshimura,et al. Solving the Coalition Structure Generation Problem with MaxSAT , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[17] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[18] Vincent Conitzer,et al. Coalition Structure Generation Utilizing Compact Characteristic Function Representations , 2009, CP.

[19] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[20] Nicholas R. Jennings,et al. An Efficient Vector-Based Representation for Coalitional Games , 2013, IJCAI.

[21] Michael Wooldridge,et al. Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[22] Vincent Conitzer,et al. Complexity of constructing solutions in the core based on synergies among coalitions , 2006, Artif. Intell..

[23] L. Shapley. A Value for n-person Games , 1988 .

[24] Sarvapali D. Ramchurn,et al. Anytime coalition structure generation on synergy graphs , 2014, AAMAS.

[25] E. Kohlberg. On the Nucleolus of a Characteristic Function Game , 1971 .

[26] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[27] W. Lucas,et al. N‐person games in partition function form , 1963 .

[28] Sarvapali D. Ramchurn,et al. An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[29] Makoto Yokoo,et al. Coalition Structure Generation based on Distributed Constraint Optimization , 2010, AAAI.

[30] R. Myerson. Values of games in partition function form , 1977 .

[31] Makoto Yokoo,et al. Finding the Core for Coalition Structure Utilizing Dual Solution , 2013, 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT).

[32] D. Yun Yeh,et al. A Dynamic Programming Approach to the Complete Set Partitioning Problem , 1986, BIT.

[33] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[34] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[35] Nicholas R. Jennings,et al. Coalition structure generation: A survey , 2015, Artif. Intell..

[36] Makoto Yokoo,et al. Concise Characteristic Function Representations in Coalitional Games Based on Agent Types , 2011, IJCAI.

[37] Nicholas R. Jennings,et al. An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[38] Onn Shehory,et al. Coalition structure generation with worst case guarantees , 2022 .

[39] Nicholas R. Jennings,et al. A hybrid exact algorithm for complete set partitioning , 2016, Artif. Intell..

[40] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..

[41] Enrique Castillo,et al. Building and Solving Mathematical Programming Models in Engineering and Science , 2001 .

[42] Vincent Conitzer,et al. Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains , 2004, AAAI.

[43] Nimrod Megiddo,et al. Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[44] Yoav Shoham,et al. Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

[45] Sarvapali D. Ramchurn,et al. On coalition formation with sparse synergies , 2012, AAMAS.

[46] Makoto Yokoo,et al. Handling negative value rules in MC-net-based coalition structure generation , 2012, AAMAS.

[47] Nicholas R. Jennings,et al. Coalition Structure Generation over Graphs , 2012, J. Artif. Intell. Res..

[48] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..