Graphical Hedonic Games of Bounded Treewidth
暂无分享,去创建一个
[1] Yingqian Zhang,et al. On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences , 2009, ADT.
[2] Vincent Conitzer,et al. Combinatorial Auctions with Structured Item Graphs , 2004, AAAI.
[3] Georg Gottlob,et al. On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition , 2007, EC '07.
[4] Yann Chevaleyre,et al. Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.
[5] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..
[6] Morteza Zadimoghaddam,et al. Optimal Coalition Structure Generation in Cooperative Graph Games , 2013, AAAI.
[7] Matthew O. Jackson,et al. The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..
[8] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[9] Hans L. Bodlaender,et al. Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.
[10] Bruno Courcelle,et al. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.
[11] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[12] Paul Harrenstein,et al. Fractional Hedonic Games , 2014, AAMAS.
[13] Gerhard J. Woeginger,et al. Core Stability in Hedonic Coalition Formation , 2012, SOFSEM.
[14] Robin I. M. Dunbar. Neocortex size as a constraint on group size in primates , 1992 .
[15] Dominik Peters. $Σ_2^p$-complete Problems on Hedonic Games , 2015, ArXiv.
[16] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..
[17] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[18] Coralio Ballester,et al. NP-completeness in hedonic games , 2004, Games Econ. Behav..
[19] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[20] Tayfun Sönmez,et al. Core in a simple coalition formation game , 2001, Soc. Choice Welf..
[21] Dominik Peters. $\Sigma_2^p$-complete Problems on Hedonic Games , 2015 .
[22] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[23] B. Mohar,et al. Graph Minors , 2009 .
[24] Jérôme Lang,et al. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.
[25] Dinko Dimitrov,et al. Computational Complexity in Additive Hedonic Games , 2010 .
[26] Blair D. Sullivan,et al. Tree-Like Structure in Large Social and Information Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.
[27] Edith Elkind,et al. Hedonic Games with Graph-restricted Communication , 2016, AAMAS.
[28] Martin Grohe,et al. The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[29] Michael Wooldridge,et al. Hedonic coalition nets , 2009, AAMAS.
[30] Edith Elkind,et al. Simple Causes of Complexity in Hedonic Games , 2015, IJCAI.