Computationally Manageable Combinational Auctions
Management Science
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
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
A Heuristic Method for the Set Covering Problem
Operations Research
An Intelligent Brokering System to Support Multi-Agent Web-Based 4th-Party Logistics
ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by applying subgradient optimization with variable fixing. A number of different bid ordering and selection rules are used in our heuristic. Moreover, an effective local search refinement procedure is presented at the end of our algorithm. We propose a new methodology PBP to produce realistic test problems which are computationally more difficult than CATS generated benchmarks. LAHA was tested on 238 problems of 13 different distributions. Among the 146 problems for which the optimum is known, LAHA found the optimum in 91 cases and produce on average 99.2% optimal solutions for the rest. Moreover, on the other 92 hard problems for which the optimum is not known, LAHA’s solutions were on average 2% better than the solutions generated by CPLEX 8.0 in 30 minutes.