An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
暂无分享,去创建一个
[1] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[2] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[3] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[4] Arne Andersson,et al. Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.
[5] Moshe Tennenholtz,et al. An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.
[6] Toby Walsh. Depth-bounded Discrepancy Search , 1997, IJCAI.
[7] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[8] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[9] Michael P. Wellman. A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..
[10] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[11] Subhash Suri,et al. Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.
[12] Paul R. Milgrom,et al. Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.
[13] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[14] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..
[15] Hal R. Varian,et al. Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.
[16] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.