Combinatorial auctions with tractable winner determination
暂无分享,去创建一个
[1] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[2] Vincent Conitzer,et al. Combinatorial Auctions with Structured Item Graphs , 2004, AAAI.
[3] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[4] D. Lehmann,et al. The Winner Determination Problem , 2003 .
[5] Georg Gottlob,et al. On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition , 2007, EC '07.
[6] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[7] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[8] Subhash Suri,et al. BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..
[9] Anand Rajaraman,et al. Conjunctive query containment revisited , 1997, Theor. Comput. Sci..
[10] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[11] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..