Computationally Manageable Combinational Auctions
Management Science
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
An experimental analysis of multi-attribute auctions
Decision Support Systems
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Combinatorial auctions using rule-based bids
Decision Support Systems
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Incompletely specified combinatorial auction: an alternative allocation mechanism for business-to-business negotiations
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
A New and Improved Design for Multiobject Iterative Auctions
Management Science
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Market Segmentation Within Consolidated E-Markets: A Generalized Combinatorial Auction Approach
Journal of Management Information Systems
A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats
Information Systems Research
Improving efficiency in multiple-unit combinatorial auctions: Bundling bids from multiple bidders
Decision Support Systems
Fostering Networked Business Operations: A Framework for B2B Electronic Intermediary Development
International Journal of Intelligent Information Technologies
Hi-index | 0.00 |
Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block to the widespread use of combinatorial auctions is the complexity of the winner-determination problem, which is known to be NP-complete. We consider a rich version of combinatorial auctions, rule-based combinatorial auctions, where bids consist of rules that describe acceptable bundles rather than provide complete enumerations of acceptable bundles. This makes the winner-determination problem potentially harder because the problem must find bundles meeting bid criterion as well as finding an optimal selection of winning bids. This paper describes in detail a heuristic that achieves a satisfying solution to the winner-determination problem for large problems where exact solutions may not be attainable. Our contribution is threefold. First, we give a general approach to providing good approximations to the winner-determination problem for rule-based auctions. Although the approach requires adaptation for specific instances, it is conceptually tractable and implementable. Second, the approach is illustrated and tested on an auction format for selling prime-time television advertising time formed from data and interviews with industry sources. Third, while some researchers have used commercial solvers that appeared to obviate the need for specialized solution approaches to the winner-determination problem, we give evidence that, at least for the problem studied here, specialized approaches are necessary.