On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
暂无分享,去创建一个
[1] Georg Gottlob,et al. Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..
[2] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[3] Craig Boutilier,et al. Solving concisely expressed combinatorial auction problems , 2002, AAAI/IAAI.
[4] Noam Nisan,et al. An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.
[5] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[6] Subhash Suri,et al. BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..
[7] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[8] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[9] Jeremy P. Spinrad,et al. An O(n2 algorithm for circular-arc graph recognition , 1993, SODA '93.
[10] R. McAfee,et al. Analyzing the Airwaves Auction , 1996 .
[11] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[12] Tuomas Sandholm,et al. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.
[13] Georg Gottlob,et al. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2003, J. Comput. Syst. Sci..
[14] D. Lehmann,et al. The Winner Determination Problem , 2003 .
[15] Vincent Conitzer,et al. Combinatorial Auctions with Structured Item Graphs , 2004, AAAI.
[16] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[17] Moshe Tennenholtz. Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.
[18] S. Ramey,et al. Acknowledgement , 2000, NeuroImage.
[19] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[20] Tuomas Sandholm,et al. Optimal Winner Determination Algorithms , 2005 .
[21] Georg Gottlob,et al. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2001, PODS '01.
[22] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .
[23] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[24] Rolf H. Möhring,et al. An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..