Computationally Manageable Combinational Auctions
Management Science
Approaches to winner determination in combinatorial auctions
Decision Support Systems - Special issue on information and computational economics
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial auctions, an example of algorithm theory in real life
Computer Science in Perspective
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
| Hi-index | 0.00 |
Combinatorial Auctions are preferable to traditional (sequential) auctions since they allow bidders to express complementarity and substitutability relationships between items, and hence may enhance economic efficiency. However, in such auctions, the problem of determining the optimal winning bids is \textitNP-hard in the general case. In a recent paper, Leyton-Brown et al. have proposed an algorithm for computing the winners in a multi-unit combinatorial auction. It is a branch and bound algorithm that makes use of a caching technique. In this note, we present a counterexample to show that caching, as described by the authors, may fail and the algorithm may eventually give a suboptimal solution. We discuss why it fails and propose how it could be fixed and properly used in a General (multi-unit) combinatorial auction.