An efficient approximate algorithm for winner determination in combinatorial auctions

Auctions on the Internet have become especially popular in Electronic Commerce. Amongthe various studies on the Internet auctions, those on combinatorial auctions have lately attracted considerable attention. Combinatorial auctions simultaneously sell multiple items with interdependent values and allow the bidders to bid on any combination of items. Therefore, they tend to increase the buyers’ utilities and the seller’s revenue.

[1]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[2]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[3]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[4]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[5]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[6]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[7]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[8]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[9]  Toby Walsh.  Depth-bounded Discrepancy Search , 1997, IJCAI.

[10]  Subhash Suri,et al.  Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.

[11]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[12]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[13]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[14]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[15]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[16]  Hal R. Varian,et al.  Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.

[17]  Paul R. Milgrom,et al.  Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.

[18]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.