Winner determination in combinatorial auction generalizations
暂无分享,去创建一个
David Levine | Subhash Suri | Tuomas Sandholm | Andrew Gilpin | S. Suri | T. Sandholm | Andrew Gilpin | David Levine
[1] Arild Stubhaug. Acta Mathematica , 1886, Nature.
[2] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[3] 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.
[4] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[5] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[6] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[7] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[8] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[9] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[10] Subhash Suri,et al. Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.
[11] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[12] Moshe Tennenholtz,et al. An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.
[13] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[14] Arne Andersson,et al. Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.
[15] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[16] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[17] David Levine,et al. CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.
[18] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[19] Tuomas Sandholm. eMediator: A Next Generation Electronic Commerce Server , 2002, Comput. Intell..
[20] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[21] S. Suri,et al. Solving combinatorial exchanges: optimality via a few partial bids , 2003, EC '03.
[22] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[23] Subhash Suri,et al. Solving combinatorial exchanges: optimality via a few partial bids , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..