Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
An auction-based method for decentralized train scheduling
Proceedings of the fifth international conference on Autonomous agents
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Scheduling tasks with precedence constraints to solicit desirable bid combinations
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Hi-index | 0.00 |
This paper presents a formulation and an algorithm for the winner determination problem in auction-based decentralized scheduling. Without imposing a time line discretization, the proposed approach allows bidders to bid for the processing of a set of tasks under release time and due date constraints using an expressive bidding language designed for decentralized scheduling. The proposed winner determination algorithm uses a depth first branch and bound search. The search branches on bids and a constraint directed scheduling procedure is used at each node to verify the feasibility of the allocation. Experiments against a commercial optimization package, CPLEX 10.0, show that the proposed algorithm is more than an order of magnitude faster on average over a set of winner determination problems of decentralized scheduling generated based on a suite of job shop constraint satisfaction benchmark problems previously developed in the literature.